Some Remarks on Automata Minimality

  • Antonio Restivo
  • Roberto Vaglica
Conference paper

DOI: 10.1007/978-3-642-22321-1_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)
Cite this paper as:
Restivo A., Vaglica R. (2011) Some Remarks on Automata Minimality. In: Mauri G., Leporati A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg

Abstract

It is well known that the minimization problem of deterministic finite automata (DFAs) is related to the indistinguishability notion of states (cf. [HMU00]). Indeed, a well known technique to minimize a DFA, essentially, consists in finding pairs of states that are equivalent (or indistinguishable), namely pairs of states (p,q) such that it is impossible to assert the difference between p and q only by starting in each of the two states and asking whether or not a given input string leads to a final state. Since, in the testing states equivalence, the notion of initial state is irrelevant, some of the main techniques for the minimization of automata, such as Moore’s algorithm [Moo56] and Hopcroft’s algorithm [Hop71], do not care what is the initial state of the automaton, when applied to accessible automata (i.e. such that all states can be reached from the initial state). Therefore a natural question that arises is, for accessible automata, on what does minimality depend? Obviously, it depends on both the automata transitions and the set of final states. In this paper, our main focus is to investigate to what extent minimality depends on the particular subset of final states.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Antonio Restivo
    • 1
  • Roberto Vaglica
    • 1
  1. 1.Dipartimento di Matematica e InformaticaUniversità degli Studi di PalermoPalermoItaly

Personalised recommendations