Skip to main content
SpringerLink
Log in

Scattered Context-Free Linear Orderings

  • Conference paper
Book cover Developments in Language Theory (DLT 2011)

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

Included in the following conference series:

Abstract

We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.

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. Blum, N., Koch, R.: Greibach normal form transformation. Information and Computation 150, 112–118 (1999) (revisited)

    Google Scholar 

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

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

  4. Bloom, S.L., Ésik, Z.: Algebraic ordinals. Fundamenta Informaticæ 99, 383–407 (2010)

    MathSciNet  MATH  Google Scholar 

  5. Bloom, S.L., Ésik, Z.: Algebraic linear orderings. In: Int. J. Foundations of Computer Science (to appear)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Ésik, Z.: Algebraic and context-free linear orderings. Slides Presented at, Workshop on Higher-Order Recursion Schemes & Pushdown Automata, Paris, March 10–12 (2010), http://www.liafa.jussieu.fr/~serre/WorkshopSchemes/

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Zoltán Ésik

Authors
  1. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336, Edificio U14, 20126, Milano, Italy

    Giancarlo Mauri  & Alberto Leporati  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ésik, Z. (2011). Scattered Context-Free Linear Orderings. In: Mauri, G., Leporati, A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22321-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22321-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation