Cover Image

Image Reflection on Process Graphs -- A Novel Approach for the Completeness of an Axiomatization of 1-Free Regular Expressions Modulo Bisimilarity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Yuanrui, Liu, Xinxin
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bisimilarity in fresh-register automata
by: Murawski, Andrzej S., et al.
Published: (2020)

Minimising the Probabilistic Bisimilarity Distance
by: Kiefer, Stefan, et al.
Published: (2024)

A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)

Robust Probabilistic Bisimilarity for Labelled Markov Chains
by: Fatmi, Syyeda Zainab, et al.
Published: (2025)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
by: Nakamura, Yoshiki
Published: (2026)

On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle
by: Ancona, Davide, et al.
Published: (2025)

Random Graph Generation in Context-Free Graph Languages
by: Vastarini, Federico, et al.
Published: (2024)

Kofola 1.0: A Modular Approach to ω-Regular Complementation and Inclusion Checking (Technical Report)
by: Alexaj, Ondrej, et al.
Published: (2026)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
by: Iosif, Radu, et al.
Published: (2023)

Fractals from Regular Behaviours
by: Schmid, Todd, et al.
Published: (2023)

Characterization and Decidability of FC-Definable Regular Languages
by: Thompson, Sam M., et al.
Published: (2025)

Synthesis of Computable Regular Functions of Infinite Words
by: Dave, V., et al.
Published: (2019)

Complete Test Suites for Automata in Monoidal Closed Categories
by: Kocsis, Bálint, et al.
Published: (2024)

Algebraic Characterizations of Classes of Regular Languages in DynFO
by: Barloy, Corentin, et al.
Published: (2026)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)

Learning Quantitative Automata Modulo Theories
by: Hsiung, Eric, et al.
Published: (2024)

HornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses(Technical Report)
by: Jiang, Hongjian, et al.
Published: (2025)

Parity Games on Temporal Graphs
by: Austin, Pete, et al.
Published: (2023)

Tree-Verifiable Graph Grammars
by: Chimes, Mark, et al.
Published: (2024)

A Trichotomy for Regular Trail Queries
by: Martens, Wim, et al.
Published: (2019)

Weighted GKAT: Completeness and Complexity
by: Van Koevering, Spencer, et al.
Published: (2025)

The Decision Problem for Regular First-Order Theories
by: Mathur, Umang, et al.
Published: (2024)

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Finding Regular Herbrand Models for CHCs using Answer Set Programming
by: Maire, Gregoire, et al.
Published: (2025)

Bisimulation for Feller-Dynkin Processes
by: Chen, Linan, et al.
Published: (2019)

Homomorphism Problems in Graph Databases and Automatic Structures
by: Morvan, Rémi
Published: (2025)

Softmax Transformers are Turing-Complete
by: Jiang, Hongjian, et al.
Published: (2025)

Relating Reversible Petri Nets and Reversible Event Structures, categorically
by: Melgratti, Hernán, et al.
Published: (2023)

Parikh's Theorem Made Symbolic
by: Hague, Matthew, et al.
Published: (2023)

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
by: Li, Shuo, et al.
Published: (2023)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)