Skip to main content
SpringerLink
Log in

Hausdorff Rank of Scattered Context-Free Linear Orders

  • Conference paper
LATIN 2012: Theoretical Informatics (LATIN 2012)

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

Included in the following conference series:

Abstract

We consider context-free languages equipped with the lexicographic ordering. We show that when the lexicographic ordering of a context-free language is scattered, then its Hausdorff rank is less than ω ω. As an application of this result, we obtain that an ordinal is the order type of the lexicographic ordering of a context-free language if and only if it is less than \(\omega^{\omega^\omega}\).

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. Bedon, N., Bès, A., Carton, O., Rispal, C.: Logic and Rational Languages of Words Indexed by Linear Orderings. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol. 5010, pp. 76–85. Springer, Heidelberg (2008)

    Google Scholar 

  2. Bès, A., Carton, O.: A Kleene Theorem for Languages of Words Indexed by Linear Orderings. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 158–167. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Braud, L., Carayol, A.: Linear Orders in the Pushdown Hierarchy. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 88–99. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Bloom, S.L., Choffrut, C.: Long words: the theory of concatenation and omega-power. Theoretical Computer Science 259, 533–548 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bloom, S.L., Ésik, Z.: Deciding whether the frontier of a regular tree is scattered. Fundamenta Informaticae 55, 1–21 (2003)

    MathSciNet  MATH  Google Scholar 

  6. Bloom, S.L., Ésik, Z.: The equational theory of regular words. Information and Computation 197, 55–89 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bloom, S.L., Ésik, Z.: Regular and Algebraic Words and Ordinals. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 1–15. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Bloom, S.L., Ésik, Z.: Algebraic ordinals. Fundamenta Informaticae 99, 383–407 (2010)

    MathSciNet  MATH  Google Scholar 

  9. Bloom, S.L., Ésik, Z.: Algebraic linear orderings. Int. J. Foundations of Computer Science 22, 491–515 (2011)

    Article  MATH  Google Scholar 

  10. Bruyère, V., Carton, O.: Automata on linear orderings. J. Comput. System Sci. 73, 1–24 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Caucal, D.: On infinite graphs having a decidable monadic theory. Theoretical Computer Science 290, 79–115 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Courcelle, B.: Frontiers of infinite trees. Theoretical Informatics and Applications 12, 319–337 (1978)

    MathSciNet  MATH  Google Scholar 

  13. Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science 25, 95–169 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  14. Damm, W.: Languages Defined by Higher Type Program Schemes. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol. 52, pp. 164–179. Springer, Heidelberg (1977)

    Chapter  Google Scholar 

  15. Damm, W.: An Algebraic Extension of the Chomsky-Hierarchy. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 266–276. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  16. Delhommé, C.: Automaticité des ordinaux et des graphes homogènes. C. R. Acad. Sci. Paris, Ser. I 339, 5–10 (2004)

    Article  MATH  Google Scholar 

  17. Ésik, Z.: Representing small ordinals by finite automata. In: Proc. 12th Workshop Descriptional Complexity of Formal Systems, Saskatoon, Canada. EPTCS, vol. 31, pp. 78–87 (2010)

    Google Scholar 

  18. Ésik, Z.: An undecidable property of context-free linear orders. Information Processing Letters 111, 107–109 (2010)

    Article  Google Scholar 

  19. Ésik, Z.: Scattered Context-Free Linear Orderings. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 216–227. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  20. Ésik, Z., Iván, S.: Büchi context-free languages. Theoretical Computer Science 412, 805–821 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  21. Ésik, Z., Iván, S.: On Müller Context-Free Grammars. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 173–184. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  22. Heilbrunner, S.: An algorithm for the solution of fixed-point equations for infinite words. Theoretical Informatics and Applications 14, 131–141 (1980)

    MathSciNet  MATH  Google Scholar 

  23. Khoussainov, B., Rubin, S., Stephan, F.: On automatic partial orders, in. In: Eighteenth IEEE Symposium on Logic in Computer Science, LICS, pp. 168–177. IEEE Press (2003)

    Google Scholar 

  24. Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Trans. Comput. Log. 6, 625–700 (2005)

    Article  MathSciNet  Google Scholar 

  25. Kuske, D., Liu, J., Lohrey, M.: The isomorphism problem on classes of automatic structures. In: LICS 2010, pp. 160–169. IEEE Computer Society (2010)

    Google Scholar 

  26. Lohrey, M., Mathissen, C.: Isomorphism of Regular Trees and Words. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 210–221. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  27. Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  28. Rosenstein, J.G.: Linear Orderings. Pure and Applied Mathematics, vol. 98. Academic Press (1982)

    Google Scholar 

  29. Thomas, W.: On frontiers of regular trees. Theoretical Informatics and Applications 20, 371–381 (1986)

    MATH  Google Scholar 

  30. Toulmin, G.H.: Shuffling ordinals and transfinite dimension. Proc. London Math. Soc. 3, 177–195 (1954)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Szeged, Szeged, Hungary

    Zoltán Ésik & Szabolcs Iván

Authors
  1. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Szabolcs Iván
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Iowa State University, 50011, Ames, IA, USA

    David Fernández-Baca

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ésik, Z., Iván, S. (2012). Hausdorff Rank of Scattered Context-Free Linear Orders . In: Fernández-Baca, D. (eds) LATIN 2012: Theoretical Informatics. LATIN 2012. Lecture Notes in Computer Science, vol 7256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29344-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29344-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29343-6

  • Online ISBN: 978-3-642-29344-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation