On the Construction of Reversible Automata for Reversible Languages

Authors:
Sylvain Lombardy
Affiliations:
-
Venue:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Year:
2002

Citing 3
Cited 12

On Reversible Automata

LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Star Height of Reversible Languages and Universal Automata

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
General properties of star height of regular events

Journal of Computer and System Sciences

Introducing VAUCANSON

Theoretical Computer Science - Implementation and application of automata
A reversible programming language and its invertible self-interpreter

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
On the efficient construction of quasi-reversible automata for reversible languages

Information Processing Letters
On locally reversible languages

Theoretical Computer Science
Syntactic semiring and universal automaton

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Introducing VAUCANSON

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
On the size of the universal automaton of a regular language

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On transition minimality of bideterministic automata

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Bisimulations for fuzzy automata

Fuzzy Sets and Systems
Reversible pushdown automata

Journal of Computer and System Sciences
Time-Symmetric machines

RC'13 Proceedings of the 5th international conference on Reversible Computation
Nondeterministic automata: Equivalence, bisimulations, and uniform relations

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reversible languages occur in many different domains. Although the decision for the membership of reversible languages was solved in 1992 by Pin, an effective construction of a reversible automaton for a reversible language was still unknown. We give in this paper a method to compute a reversible automaton from the minimal automaton of a reversible language. With this intention, we use the universal automaton of the language that can be obtained from the minimal automaton and that contains an equivalent automaton which is quasi-reversible. This quasi-reversible automaton has nearly the same properties as a reversible one and can easily be turned into a reversible automaton.