Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Descriptional Complexity of Formal Systems

DCFS 2013: Descriptional Complexity of Formal Systems pp 66–77Cite as

State Complexity of Subtree-Free Regular Tree Languages

  • Conference paper

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

Abstract

We introduce subtree-free regular tree languages that often appear in XML schemas and investigate the state complexity of basic operations on subtree-free regular tree languages. The state complexity of an operation for regular tree languages is the number of states that are sufficient and necessary in the worst-case for the minimal deterministic ranked tree automaton that accepts the tree language obtained from the operation. We establish the precise state complexity of (sequential, parallel) concatenation, (bottom-up, top-down) star, intersection and union for subtree-free regular tree languages.

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. Berstel, J., Perrin, D.: Theory of Codes. Academic Press, Inc. (1985)

    Google Scholar 

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

  3. Comon, H., Dauchet, M., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), Electronic book available at www.tata.gforge.inria.fr

  4. Domaratzki, M., Okhotin, A.: State complexity of power. Theoretical Computer Science 410(24-25), 2377–2392 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ésik, Z., Gao, Y., Liu, G., Yu, S.: Estimation of state complexity of combined operations. Theoretical Computer Science 410(35), 3272–3280 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gao, Y., Salomaa, K., Yu, S.: The state complexity of two combined operations: Star of catenation and star of reversal. Fundamenta Informaticae 83(1-2), 75–89 (2008)

    MathSciNet  MATH  Google Scholar 

  7. Gécseg, F., Steinby, M.: Handbook of Formal Languages. Tree languages. In: vol. 3, pp. 1–68 (1997)

    Google Scholar 

  8. Han, Y.-S., Salomaa, K.: State complexity of union and intersection of finite languages. International Journal of Foundations of Computer Science 19(3), 581–595 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Han, Y.-S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theoretical Computer Science 410(27-29), 2537–2548 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Han, Y.-S., Salomaa, K., Wood, D.: State complexity of prefix-free regular languages. In: Proceedings of the 8th International Conference on Descriptional Complexity of Formal Systems, pp. 165–176 (2006)

    Google Scholar 

  11. Hricko, M., Jirásková, G., Szabari, A.: Union and intersection of regular languages and descriptional complexity. Proceedings of the 7th International Conference on Descriptional Complexity of Formal Systems 2005, 170–181 (2005)

    Google Scholar 

  12. Jirásek, J., Jirásková, G., Szabari, A.: State complexity of concatenation and complementation. International Journal of Foundations of Computer Science 16(3), 511–529 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Martens, W., Niehren, J.: On the minimization of XML schemas and tree automata for unranked trees. Journal of Computer System Sciences 73(4), 550–583 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Maslov, A.: Estimates of the number of states of finite automata. Soviet Mathematics Doklady 11, 1373–1375 (1970)

    MATH  Google Scholar 

  15. Nerode, A.: Linear automaton transformations. Proceedings of the American Mathematical Society 9(4), 541–544 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  16. Neven, F.: Automata theory for XML researchers. ACM SIGMOD Record 31(3), 39–46 (2002)

    Article  Google Scholar 

  17. Piao, X., Salomaa, K.: State trade-offs in unranked tree automata. In: Proceedings of the 13th International Conference on Descriptional Complexity of Formal Systems, pp. 261–274 (2011)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  19. Piao, X., Salomaa, K.: State complexity of kleene-star operations on trees. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds.) Computation, Physics and Beyond. LNCS, vol. 7160, pp. 388–402. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  20. Piao, X., Salomaa, K.: State complexity of the concatenation of regular tree languages. Theoretical Computer Science 429, 273–281 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  21. Pighizzini, G., Shallit, J.: Unary language operations, state complexity and Jacobsthal’s function. International Journal of Foundations of Computer Science 13(1), 145–159 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  23. Rampersad, N.: The state complexity of L 2 and L k. Information Processing Letters 98(6), 231–234 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  24. Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theoretical Computer Science 383(2-3), 140–152 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  25. Salomaa, K., Yu, S.: On the state complexity of combined operations and their estimation. International Journal of Foundations of Computer Science 18, 683–698 (2007)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  27. 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, Yonsei University, 50, Yonsei-Ro, Seodaemun-Gu, Seoul, 120-749, Republic of Korea

    Hae-Sung Eom, Yo-Sub Han & Sang-Ki Ko

Authors
  1. Hae-Sung Eom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yo-Sub Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sang-Ki Ko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, Western University, N6A 5B7, London, ON, Canada

    Helmut Jurgensen

  2. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055,, 4169-007, Porto, Portugal

    Rogério Reis

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eom, HS., Han, YS., Ko, SK. (2013). State Complexity of Subtree-Free Regular Tree Languages. In: Jurgensen, H., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2013. Lecture Notes in Computer Science, vol 8031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39310-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39310-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-39310-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation