Skip to main content
SpringerLink
Log in

State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism

  • Conference paper
Book cover Descriptional Complexity of Formal Systems (DCFS 2014)

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

Included in the following conference series:

Abstract

We study the state complexity of language operations for unary NFAs with limited nondeterminism. We consider the operations of concatenation, Kleene star, and complement. We give upper bounds for the state complexity of these language operations and lower bounds that are fairly close to the upper bounds. Our constructions rely on the fact that minimal unary NFAs with limited nondeterminism can be found in Chrobak normal form.

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. Aliev, I.M., Gruber, P.M.: An optimal lower bound for the Frobenius problem. Journal of Number Theory 123(1), 71–79 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bach, E., Shallit, J.: Algorithmic Number Theory: Efficient Algorithms, vol. 1. MIT Press (1996)

    Google Scholar 

  3. Beck, M., Diaz, R., Robins, S.: The Frobenius problem, rational polytopes, and fourier–dedekind sums. Journal of Number Theory 96(1), 1–21 (2002)

    MATH  MathSciNet  Google Scholar 

  4. Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47(3), 149–158 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gao, Y., Moreira, N., Reis, R., Sheng, Y.: A review of state complexity of individual operations. Technical report, Universidade do Porto, Technical Report Series DCC-2011-08, Version 1.1 (2012), http://www.dcc.fc.up.pt/Pubs

  6. Gawrychowski, P.: Chrobak normal form revisited, with applications. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 142–153. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. UCS 8(2), 193–234 (2002)

    MATH  MathSciNet  Google Scholar 

  8. Goldstine, J., Kintala, C.M.R., Wotschke, D.: On measuring nondeterminism in regular languages. Inf. Comput. 86(2), 179–194 (1990)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Holzer, M., Kutrib, M.: Unary language operations and their nondeterministic state complexity. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 162–172. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata - a survey. Inf. Comput. 209(3), 456–470 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hromkovič, J., Karhumäki, J., Klauck, H., Schnitger, G., Seibert, S.: Measures of nondeterminism in finite automata. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 199–210. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Hromkovic, J., Seibert, S., Karhumäki, J., Klauck, H., Schnitger, G.: Communication complexity method for measuring nondeterminism in finite automata. Inf. Comput. 172(2), 202–217 (2002)

    Article  MATH  Google Scholar 

  15. Jiang, T., McDowell, E., Ravikumar, B.: The structure and complexity of minimal nfa’s over a unary alphabet. In: Biswas, S., Nori, K.V. (eds.) FSTTCS 1991. LNCS, vol. 560, pp. 152–171. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  16. Kutrib, M., Pighizzini, G.: Recent trends in descriptional complexity of formal languages. Bulletin of EATCS 3(111) (2013)

    Google Scholar 

  17. Leung, H.: Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput. 27(4), 1073–1082 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  18. Leung, H.: Descriptional complexity of nfa of different ambiguity. Int. J. Found. Comput. Sci. 16(5), 975–984 (2005)

    Article  MATH  Google Scholar 

  19. Maslov, A.N.: Estimates of the number of states of finite automata. Doklady Akademii Nauk SSSR 194, 1266–1268 (1970)

    MathSciNet  Google Scholar 

  20. Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: SWAT (FOCS), pp. 188–191. IEEE Computer Society (1971)

    Google Scholar 

  21. Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Transactions on Computers C-20(10), 1211–1214 (1971)

    Google Scholar 

  22. Okhotin, A.: Unambiguous finite automata over a unary alphabet. Inf. Comput. 212, 15–36 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  23. Palioudakis, A., Salomaa, K., Akl, S.G.: State complexity and limited nondeterminism. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol. 7386, pp. 252–265. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  24. Palioudakis, A., Salomaa, K., Akl, S.G.: Comparisons between measures of nondeterminism on finite automata. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 217–228. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  25. Palioudakis, A., Salomaa, K., Akl, S.G.: Unary nfas with limited nondeterminism. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 443–454. Springer, Heidelberg (2014)

    Google Scholar 

  26. Pighizzini, G., Shallit, J.: Unary language operations, state complexity and jacobsthal’s function. Int. J. Found. Comput. Sci. 13(1), 145–159 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  27. Shallit, J.O.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2008)

    Google Scholar 

  28. Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoret. Comput. Sci. 125(2), 315–328 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  29. Sheng, Y.: Regular Languages. In: Handbook of Formal Languages, vol. 1, pp. 41–110. Springer (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Queen’s University, Kingston, Ontario, K7L 3N6, Canada

    Alexandros Palioudakis, Kai Salomaa & Selim G. Akl

Authors
  1. Alexandros Palioudakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Selim G. Akl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Helmut Jürgensen

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

    Juhani Karhumäki

  3. University of Turku, Fi-20014, Turku, Finland

    Alexander Okhotin

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Palioudakis, A., Salomaa, K., Akl, S.G. (2014). State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2014. Lecture Notes in Computer Science, vol 8614. Springer, Cham. https://doi.org/10.1007/978-3-319-09704-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09704-6_29

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09703-9

  • Online ISBN: 978-3-319-09704-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation