Skip to main content
SpringerLink
Log in

On State Complexity of Finite Word and Tree Languages

  • Conference paper
Developments in Language Theory (DLT 2012)

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

Included in the following conference series:

Abstract

We investigate the state complexity of finite word and tree languages. In particular, (1) we establish the state complexity of word languages whose words have bounded length; (2) we improve the upper bound given in [6] for union and intersection of finite word languages; and (3) we present an upper bound for union and intersection of finite tree languages.

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. Birget, J.-C.: Intersection of regular languages and state complexity. ACM SIGACT News 22(2), 49 (1991)

    Article  Google Scholar 

  2. Bojanczyk, M.: Decidable properties of tree languages. PhD Thesis. Warsaw University (2004)

    Google Scholar 

  3. Câmpeanu, C., Culik II, K., Salomaa, K., Yu, S.: State Complexity of Basic Operations on Finite Languages. In: Boldt, O., Jürgensen, H. (eds.) WIA 1999. LNCS, vol. 2214, pp. 60–70. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Dacuik, J., Watson, B.W., Watson, R.E.: Incremental Construction of Minimal Acyclic Finite State Automata and Transducers. In: Proc. of Finite State Methods in Natural Language Processing (FSMNLP 1998), pp. 48–56 (1998)

    Google Scholar 

  5. Gandhi, A., Ke, N.R., Khoussainov, B.: State complexity of determinization and complementation for finite automata. In: Proc. of CATS 2011, CRPIT, vol. 119, pp. 105–110 (2011)

    Google Scholar 

  6. Han, Y., Salomaa, K.: State complexity of union and intersection of finite languages. Intl. J. Found. Comput. Sci. 19(3), 581–595 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Han, Y., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theor. Comput. Sci. 410(27-29), 2537–2548 (2009)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata – A survey. Inf. and Computation 209, 456–470 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Jirásek, J., Jirásková, G., Szabari, A.: Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 254–265. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

  13. Mohri, M.: On some applications of finite-state automata theory to natural language processing. Natural Lang. Engg. 2 (1996)

    Google Scholar 

  14. Piao, X., Salomaa, K.: Transformations between different models of unranked bottom-up tree automata. Fund. Inf. 109(4), 405–424 (2011)

    MathSciNet  MATH  Google Scholar 

  15. Piao, X., Salomaa, K.: State Complexity of Kleene-Star Operations on Trees. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds.) WTCS 2012. LNCS, vol. 7160, pp. 388–402. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  16. Safra, S.: On the complexity of ω-automata. In: Proc. 29th IEEE Symp. on Foundations of Computer Science (FOCS 1988), White Plains, pp. 319–327 (1988)

    Google Scholar 

  17. Yu, S.: State complexity of regular languages. Journal of Automata, Language and Combinatorics 6(2), 221–234 (2001)

    MATH  Google Scholar 

  18. Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoretical Computer Science 125(2), 315–328 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Auckland, New Zealand

    Aniruddh Gandhi & Bakhadyr Khoussainov

  2. School of Computing and Mathematical Sciences, Auckland University of Technology, New Zealand

    Jiamou Liu

Authors
  1. Aniruddh Gandhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bakhadyr Khoussainov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiamou Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Deptartment of Electrical Engineering, National Taiwan University, 106, Taipei, Taiwan

    Hsu-Chun Yen

  2. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gandhi, A., Khoussainov, B., Liu, J. (2012). On State Complexity of Finite Word and Tree Languages. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31653-1_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31652-4

  • Online ISBN: 978-3-642-31653-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation