Skip to main content
SpringerLink
Log in

Nondeterministic Moore Automata and Brzozowski’s Algorithm

  • Conference paper
Implementation and Application of Automata (CIAA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6807))

Included in the following conference series:

Abstract

Moore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to a given NMA. In this paper we propose an algorithm that is a variant of Brzozowski’s algorithm in the sense that it is essentially structured as reverse operation and subset construction performed twice.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Béal, M.-P., Crochemore, M.: Minimizing local automata. In: IEEE International Symposium on Information Theory (ISIT 2007), pp. 1376–1380 (2007)

    Google Scholar 

  2. Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata 12, 529–561 (1962)

    Google Scholar 

  3. Calude, E., Lipponen, M.: Minimal deterministic incomplete automata. Journal of Universal Computer Science 3(11), 1180–1193 (1997)

    MathSciNet  MATH  Google Scholar 

  4. Castiglione, G., Nicaud, C., Sciortino, M.: A challenging family of automata for classical minimization algorithms. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 251–260. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Castiglione, G., Restivo, A., Sciortino, M.: Circular sturmian words and Hopcroft’s algorithm. Theor. Comput. Sci. 410, 4372–4381 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Castiglione, G., Restivo, A., Sciortino, M.: On extremal cases of Hopcroft’s algorithm. Theor. Comput. Sci. 411(38-39), 3414–3422 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cortes, C., Mohri, M.: Learning with weighted transducers. In: Piskorski, J., Watson, B.W., Anssi, Y.-J. (eds.) Frontiers in Artificial Intelligence and Applications. FSMNLP, vol. 19, pp. 14–22. IOS Press, Amsterdam (2008)

    Google Scholar 

  8. García, P., Ruíz, J., Cano, A., Alvarez, G.: Inference improvement by enlarging the training set while learning dFAs. In: Sanfeliu, A., Cortés, M.L. (eds.) CIARP 2005. LNCS, vol. 3773, pp. 59–70. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Hopcroft, J.E.: An nlogn algorithm for mimimizing the states in a finite automaton. In: Proc. Internat. Sympos. Technion, Haifa,Theory of machines and computations, pp. 189–196. Academic Press, New York (1971)

    Chapter  Google Scholar 

  10. Jirásková, G., Pighizzini, G.: Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput. 209(3), 528–535 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kameda, T., Weiner, P.: On the state minimization of nondeterministic finite automata. IEEE Trans. Comput. 19, 617–627 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kupferman, O., Vardi, M.Y.: Robust satisfaction. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 383–398. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  13. Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269–311 (1997)

    MathSciNet  Google Scholar 

  14. Mohri, M.: Minimization algorithms for sequential transducers. Theor. Comput. Sci. 234(1-2), 177–201 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Moore, E.F.: Gedaken experiments on sequential machines, pp. 129–153. Princeton University Press, Princeton (1956)

    Google Scholar 

  16. Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 114–125 (1969)

    Article  MathSciNet  Google Scholar 

  17. Solovev, V.: Minimization of Moore finite automata by internal state gluing. Journal of Communications Technology and Electronics 55, 584–592 (2010)

    Article  Google Scholar 

  18. Spivak, M.A.: Minimization of a Moore automaton. Cybernetics and Systems Analysis 3, 4–5 (1967)

    MathSciNet  Google Scholar 

  19. Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 396–411. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Takahashi, K., Fujiyoshi, A., Kasai, T.: A polynomial time algorithm to infer sequential machines. Systems and Computers in Japan 34(1), 59–67 (2003)

    Article  Google Scholar 

  21. Watson, B.W.: Taxonomies and toolkits of regular language algorithms. PhD thesis, Dep. Math. Comput. Sci. Technische Universiteit Eindhoven (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, Università di Palermo, via Archirafi, 34, 90123, Palermo, Italy

    Giusi Castiglione, Antonio Restivo & Marinella Sciortino

Authors
  1. Giusi Castiglione
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonio Restivo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marinella Sciortino
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Francois Rabelais Tours, 3, Place Jean Jaurès, 4100, Blois, France

    Béatrice Bouchou-Markhoff

  2. LITIS, Université de Rouen, 76801, Saint-Étienne du Rouvray Cedex, France

    Pascal Caron  & Jean-Marc Champarnaud  & 

  3. LI (Computer Laboratory), EPU-DI, 64 avenue Jean-Portalis, 37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castiglione, G., Restivo, A., Sciortino, M. (2011). Nondeterministic Moore Automata and Brzozowski’s Algorithm. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2011. Lecture Notes in Computer Science, vol 6807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22256-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22256-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22255-9

  • Online ISBN: 978-3-642-22256-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation