Skip to main content
SpringerLink
Log in
Book cover

Combinatorics on Words pp 18–33Cite as

Words, Trees and Automata Minimization

  • Conference paper

  • 539 Accesses

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

Abstract

In this paper we explore some connections between some combinatorial properties of words and the study of extremal cases of the automata minimization process. An intermediate role is played by the notion od word trees for which some properties of words are generalized. In particular, we describe an infinite family of binary automata, called word automata and constructed by using standard sturmian words and more specifically Fibonacci words, that represent the extremal case of some well known automata minimization algorithms, such as Moore’s and Hopcroft’s methods. As well as giving an overview of the main results in this context, the main purpose of this paper is to prove that, even if a recently introduced polynomial variants of Brzozowski’s algorithm is considered, such family of word automata represent the worst case for the number of steps and for its overall time complexity. This fact suggests that the standard sturmian words, and consequently the associated word automata, are able to capture some properties for which the minimization process becomes inherently more complex.

This is a preview of subscription content, 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   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   72.00
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brzozowski, J.A., Tamm, H.: Quotient complexities of atoms of regular languages. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 50–61. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Brzozowski, J.A., Tamm, H.: Minimal nondeterministic finite automata and atoms of regular languages. CoRR, abs/1301.5585 (2013)

    Google Scholar 

  3. Almeida, M., Moreira, N., Reis, R.: On the performance of automata minimization algorithms. Technical Report DCC-2007-03, Universidade do Porto (2007)

    Google Scholar 

  4. Berstel, J., Boasson, L., Carton, O.: Continuant polynomials and worst-case behavior of Hopcroft’s minimization algorithm. Theor. Comput. Sci. 410, 2811–2822 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Berstel, J., Boasson, L., Carton, O., Fagnot, I.: Sturmian trees. Theory of Computing Systems 46(3), 443–478 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Berstel, J., Carton, O.: On the complexity of Hopcroft’s state minimization algorithm. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 35–44. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

    Google Scholar 

  8. Castiglione, C., Sciortino, M.: Moore automata and epichristoffel words. In: ICTCS 2012 - 13th Italian Conference on Theoretical Computer Science (2012)

    Google Scholar 

  9. 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 

  10. Castiglione, G., Restivo, A., Sciortino, M.: Hopcroft’s algorithm and cyclic automata. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 172–183. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. 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 

  13. Castiglione, G., Restivo, A., Sciortino, M.: Hopcroft’s algorithm and tree-like automata. RAIRO - Theor. Inf. and Applic. 45(1), 59–75 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Champarnaud, J.-M., Khorsi, A., Paranthoën, T.: Split and join for minimizing: Brzozowski’s algorithm. In: PSC 2002, pp. 96–104 (2002)

    Google Scholar 

  15. de Luca, A.: Combinatories of standard sturmian words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 249–267. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  16. de Luca, A., Mignosi, F.: Some combinatorial properties of sturmian words. Theor. Comput. Sci. 136(2), 361–385 (1994)

    Article  MATH  Google Scholar 

  17. Mignosi, F., Restivo, A.: Characteristic sturmian words are extremal for the critical factorization theorem. Theor. Comput. Sci. 454, 199–205 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Paquin, G.: On a generalization of christoffel words: epichristoffel words. Theor. Comput. Sci. 410(38-40), 3782–3791 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. García, P., López, D., Vázquez de Parga, M.: DFA minimization: from Brzozowski to Hopcroft. Technical report, Universidad Politécnica de Valencia. Informes técnicos de investigación DSIC-TLCC (2013), http://hdl.handle.net/10251/27623

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

    Google Scholar 

  21. Berstel, J., Boasson, L., Carton, O., Fagnot, I.: Minimization of automata. CoRR, abs/1010.5318 (2010)

    Google Scholar 

  22. Sciortino, M., Zamboni, L.Q.: Suffix automata and standard sturmian words. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 382–398. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  23. Vazquez de Parga, M., Garcia, P., Lopez, D.: A polynomial double reversal minimization algorithm for deterministic finite automata. Theor. Comput. Sci. 487, 17–22 (2013)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  25. Paige, R., Tarjan, R.E., Bonic, R.: A linear time solution to the single function coarsest partition problem. Theor. Comput. Sci. 40, 67–84 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  26. De Felice, S., Nicaud, C.: Brzozowski algorithm is generically super-polynomial for deterministic automata. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 179–190. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  27. Mantaci, S., Restivo, A., Sciortino, M.: Burrows-Wheeler transform and sturmian words. Inf. Process. Lett. 86(5), 241–246 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  28. 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 

Download references

Author information

Authors and Affiliations

  1. DMI, Università di Palermo, via Archirafi, 34, 90123, Palermo, Italy

    Giusi Castiglione & Marinella Sciortino

Authors
  1. Giusi Castiglione
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marinella Sciortino
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  2. University of Turku, 20014, Turku, Finland

    Arto Lepistö

  3. FUNDIM, University of Turku, Finland

    Luca Zamboni

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castiglione, G., Sciortino, M. (2013). Words, Trees and Automata Minimization. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds) Combinatorics on Words. Lecture Notes in Computer Science, vol 8079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40579-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40579-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40578-5

  • Online ISBN: 978-3-642-40579-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation