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

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.

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Pedro García, Manuel Vazquez de Parga, Damián López
• Keywords: IPL 2008, Minimal Dfa, Quasi-reversible Automata, Reversible Language