A characterization of regular expressions under bisimulation-Reference-Cited by-同舟云学术

A characterization of regular expressions under bisimulation

Published:2007-04 Issue:2 Volume:54 Page:6
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Baeten J. C. M.¹,Corradini F.²,Grabmayer C. A.³

Affiliation:

1. Technische Universiteit Eindhoven, Eindhoven, The Netherlands

2. Università di Camerino, Camerino, Italy

3. Vrije Universiteit, Amsterdam, The Netherlands

Abstract

We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions, and we show how to determine whether a given finite automaton is in this set. As an application, we consider the star height problem.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/1219092.1219094

Reference31 articles.

1. Aceto L. Fokkink W. and Verhoef C. 2001. Structural operational semantics. In Handbook of Process Algebra J. Bergstra A. Ponse and S. Smolka Eds. Elsevier Science Amsterdam The Netherlands 197--292. Aceto L. Fokkink W. and Verhoef C. 2001. Structural operational semantics. In Handbook of Process Algebra J. Bergstra A. Ponse and S. Smolka Eds. Elsevier Science Amsterdam The Netherlands 197--292.

2. Global renaming operators in concrete process algebra

3. Baeten J. Bergstra J. and Klop J. 1987. On the consistency of Koomen's fair abstraction rule. Theoret. Comput. Sci. 51 1/2 129--176. 10.1016/0304-3975(87)90052-1 Baeten J. Bergstra J. and Klop J. 1987. On the consistency of Koomen's fair abstraction rule. Theoret. Comput. Sci. 51 1/2 129--176. 10.1016/0304-3975(87)90052-1

4. Decidability of bisimulation equivalence for process generating context-free languages

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sequential Value Passing Yields a Kleene Theorem for Processes;Lecture Notes in Computer Science;2024

2. Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics (Extended Abstract);Electronic Proceedings in Theoretical Computer Science;2023-09-14

3. Milner’s Proof System for Regular Expressions Modulo Bisimilarity is Complete;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02

4. Better Automata Through Process Algebra;Lecture Notes in Computer Science;2022

5. On Star Expressions and Completeness Theorems;Electronic Proceedings in Theoretical Computer Science;2021-12-29