On the efficient construction of quasi-reversible automata for reversible languages

Authors:
Pedro García;Manuel Vázquez de Parga;Damián López
Affiliations:
Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera s/n, 46071 Valencia, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera s/n, 46071 Valencia, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Camino de Vera s/n, 46071 Valencia, Spain
Venue:
Information Processing Letters
Year:
2008

Citing 9
Cited 3

On the languages accepted by finite reversible automata

14th International Colloquium on Automata, languages and programming
Inference of Reversible Languages

Journal of the ACM (JACM)
Learning Regular Languages Using Non Deterministic Finite Automata

ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
On the Construction of Reversible Automata for Reversible Languages

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Learning regular languages using RFSAs

Theoretical Computer Science - Special issue: Algorithmic learning theory
Residual Finite State Automata

Fundamenta Informaticae

On locally reversible languages

Theoretical Computer Science
Reversible pushdown automata

Journal of Computer and System Sciences
Time-Symmetric machines

RC'13 Proceedings of the 5th international conference on Reversible Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language represented by its minimal DFA. Our method runs in polynomial time respect to the size of the minimal DFA and improves a previous exponential method. Previous bound for the size of quasi-reversible automata is also reduced.