On Transition Minimality of Bideterministic Automata

  • Hellis Tamm
Conference paper

DOI: 10.1007/978-3-540-73208-2_38

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4588)
Cite this paper as:
Tamm H. (2007) On Transition Minimality of Bideterministic Automata. In: Harju T., Karhumäki J., Lepistö A. (eds) Developments in Language Theory. DLT 2007. Lecture Notes in Computer Science, vol 4588. Springer, Berlin, Heidelberg

Abstract

Bideterministic automata are deterministic automata with the property of their reversal automata also being deterministic. Bideterministic automata have previously been shown to be unique (up to an isomorphism) minimal NFAs with respect to the number of states. In this paper, we show that in addition to state minimality, bideterministic automata are also transition-minimal NFAs. However, as this transition minimality is not necessarily unique, we also present the necessary and sufficient conditions for a bideterministic automaton to be uniquely transition-minimal among NFAs. Furthermore, we show that bideterministic automata are transition-minimal ε-NFAs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Hellis Tamm
    • 1
  1. 1.Institute of Cybernetics, Akadeemia tee 21, 12618 TallinnEstonia

Personalised recommendations