Skip to main content
SpringerLink
Log in

Some Variants of the Star Height Problem

  • Conference paper
Mathematical Foundations of Computer Science 2011 (MFCS 2011)

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

  • 869 Accesses

Abstract

Given a family of recognizable languages L 1,…,L m and recognizable languages K 1 ⊆ K 2, the relative inclusion star height problem means to compute the minimal star height of some rational expression r over L 1,…,L m satisfying K 1 ⊆ L(r) ⊆ K 2. We show that this problem is of elementary complexity and give an analysis of its complexity.

See [22] for a full version.

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. Abdulla, P.A., Krcal, P., Yi, W.: R-automata. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 67–81. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Abdulla, P.A., Krcal, P., Yi, W.: Universality of R-automata with value copying. In: INFINITY 2008 Proceedings (2008)

    Google Scholar 

  3. Bala, S.: Regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 596–607. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Bala, S.: Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms. Theory Of Computing Systems, Special Issue of Selected Best Papers from STACS 2004 39(1), 137–163 (2006)

    MathSciNet  MATH  Google Scholar 

  5. Berstel, J.: Transductions and Context-Free Languages. B.G.Teubner, Stuttgart (1979)

    Google Scholar 

  6. Cohen, R.S.: Star height of certain families of regular events. Journal of Computer and System Sciences 4, 281–297 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  7. Colcombet, T.: The theory of stabilisation monoids and regular cost functions. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 139–150. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Colcombet, T., Löding, C.: The nesting-depth of disjunctive μ-calculus for tree languages and the limitedness problem. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 416–430. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Colcombet, T., Löding, C.: The non-deterministic mostowski hierarchy and distance-parity automata. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 398–409. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Eggan, L.C.: Transition graphs and the star height of regular events. Michigan Math. Journal 10, 385–397 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  11. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, New York (1974)

    MATH  Google Scholar 

  12. Hashiguchi, K.: A decision procedure for the order of regular events. Theoretical Computer Science 8, 69–72 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. Journal of Computer and System Sciences 24, 233–244 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hashiguchi, K.: Regular languages of star height one. Information and Control 53, 199–210 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  15. Hashiguchi, K.: Representation theorems of regular languages. Journal of Computer and System Sciences 27(1), 101–115 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hashiguchi, K.: Algorithms for determining relative star height and star height. Information and Computation 78, 124–169 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  17. Hashiguchi, K.: Algorithms for determining relative inclusion star height and inclusion star height. Theoretical Computer Science 91, 85–100 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kirsten, D.: Desert automata and the finite substitution problem. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 305–316. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Kirsten, D.: Distance desert automata and the star height one problem. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 257–272. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Kirsten, D.: A Burnside approach to the finite substitution problem. Theory of Computing Systems, Special Issue of Selected Best Papers from STACS 2004 39(1), 15–50 (2006)

    MathSciNet  MATH  Google Scholar 

  21. Kirsten, D.: Distance desert automata and star height substitutions. In: Habilitationsschrift, Universität Leipzig, Fakultät für Mathematik und Informatik (2006)

    Google Scholar 

  22. Kirsten, D.: On the complexity of the relative inclusion star height problem. Advances in Computer Science and Engineering 5(2), 173–211 (2010)

    MATH  Google Scholar 

  23. Lombardy, S.: Approche structurelle de quelques problèmes de la théorie des automates. PhD thesis, École nationale supérieure des télécommunications, Paris (2001)

    Google Scholar 

  24. McNaughton, R.: The loop complexity of pure-group events. Information and Control 11, 167–176 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  25. Sakarovitch, J.: Eléments de théorie des automates. Vuibert (2003)

    Google Scholar 

  26. Sakarovitch, J.: Elements of Automata Theory. Encyclopedia of Mathematics and Applications. Cambridge University Press, Cambridge (2009)

    Google Scholar 

  27. Simon, I.: Limited subsets of a free monoid. In: Proceedings of the 19th IEEE Annual Symposium on Foundations of Computer Science, pp. 143–150. IEEE Computer Society Press, Long Beach (1978)

    Google Scholar 

  28. Yu, S.: Regular Languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Vol. 1, Word, Language, Grammar, pp. 41–110. Springer, Berlin (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, D-10099, Berlin, Germany

    Daniel Kirsten

Authors
  1. Daniel Kirsten
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Filip Murlak  & Piotr Sankowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Kirsten, D. (2011). Some Variants of the Star Height Problem. In: Murlak, F., Sankowski, P. (eds) Mathematical Foundations of Computer Science 2011. MFCS 2011. Lecture Notes in Computer Science, vol 6907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22993-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22993-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22992-3

  • Online ISBN: 978-3-642-22993-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation