Bideterministic automata and minimal representations of regular languages

Authors:
Hellis Tamm;Esko Ukkonen
Affiliations:
Department of Computer Science, University of Helsinki, Finland;Department of Computer Science, University of Helsinki, Finland
Venue:
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Year:
2003

Citing 6
Cited 2

Minimal NFA problems are hard

SIAM Journal on Computing
Inference of Reversible Languages

Journal of the ACM (JACM)
On Reversible Automata

LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
On viewing block codes as finite automata

Theoretical Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
On the State Minimization of Nondeterministic Finite Automata

IEEE Transactions on Computers

Bideterministic automata and minimal representations of regular languages

Theoretical Computer Science - Implementation and application of automata
Minimalizations of NFA using the universal automaton

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bideterministic automata are deterministic automata with the property of their reversal automata also being deterministic. It has been known that a bideterministic automaton is the minimal deterministic automaton accepting its language. This paper shows that any bideterministic automaton is the unique minimal automaton among all (including nondeterministic) automata accepting the same language. We also present a more general result that shows that under certain conditions a minimal deterministic automaton accepting some language or the reversal of the minimal deterministic automaton of the reversal language is a minimal automaton representation of the language. These conditions can be checked in polynomial time.