Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2011: Implementation and Application of Automata pp 178–189Cite as

Nondeterministic State Complexity of Star-Free Languages

  • Conference paper

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

Abstract

We investigate the nondeterministic state complexity of several operations on finite automata accepting star-free languages. It turns out that in most cases exactly the same tight bounds as for general regular languages are reached. This nicely complements the results recently obtained in [8] for the operation problem of star-free languages accepted by deterministic finite automata.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birget, J.C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bordihn, H., Holzer, M., Kutrib, M.: Determinization of finite automata accepting subregular languages. Theoret. Comput. Sci. 410, 3209–3222 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brzozowski, J.A.: Roots of star events. J. ACM 14, 466–477 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  4. Brzozowski, J.A.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15, 71–89 (2010)

    MATH  Google Scholar 

  5. Brzozowski, J.A., Cohen, R.S.: On decompositions of regular events. J. ACM 16, 132–144 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brzozowski, J.A., Jirásková, G., Li, B., Smith, J.: Quotient complexity of bifix, factor, and subword-free languages. In: International Conference on Automata and Formal Languages (AFL 2011) (to appear)

    Google Scholar 

  7. Brzozowski, J.A., Jirásková, G., Zou, C.: Quotient complexity of closed languages. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 84–95. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Brzozowski, J.A., Liu, B.: Quotient complexity of star-free languages. In: International Conference on Automata and Formal Languages (AFL 2011) (to appear)

    Google Scholar 

  9. Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149–158 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chrobak, M.: Errata to finite automata and unary languages. Theoret. Comput. Sci. 302, 497–498 (2003)

    Article  MathSciNet  Google Scholar 

  11. Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59, 75–77 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Han, Y.S., Salomaa, K.: Nondeterministic state complexity for suffix-free regular languages. In: Descriptional Complexity of Formal Systems (DCFS 2010), EPTCS, vol. 31, pp. 189–204 (2010)

    Google Scholar 

  13. Han, Y.S., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fund. Inform. 90, 93–106 (2009)

    MathSciNet  MATH  Google Scholar 

  14. Holzer, M., Jakobi, S., Kutrib, M.: The magic number problem for subregular language families. In: Descriptional Complexity of Formal Systems (DCFS 2010), EPTCS, vol. 31, pp. 110–119 (2010)

    Google Scholar 

  15. Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14, 1087–1102 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Holzer, M., Kutrib, M.: Nondeterministic finite automata – Recent results on the descriptional and computational complexity. Int. J. Found. Comput. Sci. 20, 563–580 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Holzer, M., Kutrib, M.: Descriptional complexity – An introductory survey. In: Scientific Applications of Language Methods, pp. 1–58. Imperial College Press, London (2010)

    Chapter  Google Scholar 

  18. Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata – A survey. Inform. Comput. 209, 456–470 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  19. Jirásková, G.: State complexity of some operations on binary regular languages. Theoret. Comput. Sci. 330, 287–298 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  20. Jirásková, G., Krausová, M.: Complexity in prefix-free regular languages. In: Descriptional Complexity of Formal Systems (DCFS 2010). EPTCS, vol. 31, pp. 197–204 (2010)

    Google Scholar 

  21. Jirásková, G., Masopust, T.: Complexity in union-free regular languages. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 255–266. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  22. Jirásková, G., Olejár, P.: State complexity of intersection and union of suffix-free languages and descriptional complexity. In: Non-Classical Models of Automata and Applications (NCMA 2009). books@ocg.at, vol. 256, pp. 151–166. Austrian Computer Society (2009)

    Google Scholar 

  23. Lupanov, O.B.: A comparison of two types of finite sources. Problemy Kybernetiki 9, 321–326 (1963) (in Russian); German translation: Über den Vergleich zweier Typen endlicher Quellen. Probleme der Kybernetik  6, 328–335 (1966)

    Google Scholar 

  24. McNaughton, R., Papert, S.: Counter-Free Automata, Research Monographs, vol. 65. MIT Press, Cambridge (1971)

    MATH  Google Scholar 

  25. Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Symposium on Switching and Automata Theory (SWAT 1971), pp. 188–191. IEEE, Los Alamitos (1971)

    Chapter  Google Scholar 

  26. Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Comput. 20, 1211–1214 (1971)

    Article  MATH  Google Scholar 

  27. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114–125 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  28. Salomaa, K., Yu, S.: NFA to DFA transformation for finite languages over arbitrary alphabets. J. Autom. Lang. Comb. 2, 177–186 (1997)

    MathSciNet  MATH  Google Scholar 

  29. Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inform. Control 8, 190–194 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  30. Shyr, H.J., Thierrin, G.: Ordered automata and associated languages. Tamkang J. Math. 5, 9–20 (1974)

    MathSciNet  MATH  Google Scholar 

  31. Shyr, H.J., Thierrin, G.: Power-separating regular languages. Math. Systems Theory 8, 90–95 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  32. Yu, S.: Regular languages. In: Handbook of Formal Languages, vol. 1, pp. 41–110. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  33. Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb. 6, 221–234 (2001)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstraße 2, 35392, Giessen, Germany

    Markus Holzer, Martin Kutrib & Katja Meckel

Authors
  1. Markus Holzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Katja Meckel
    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

Holzer, M., Kutrib, M., Meckel, K. (2011). Nondeterministic State Complexity of Star-Free Languages. 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_17

Download citation

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

  • 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