Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Informatics

SOFSEM 2020: SOFSEM 2020: Theory and Practice of Computer Science pp 273–284Cite as

The Order Type of Scattered Context-Free Orderings of Rank One Is Computable

  • Conference paper
  • First Online:

  • 917 Accesses

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

Abstract

A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is known that the isomorphism problem of context-free orderings is undecidable in general. In this paper we show that it is decidable whether a context-free ordering is scattered with rank at most one, and if so, its order type is effectively computable.

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 EPUB and 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

References

  1. Bloom, S.L., Ésik, Z.: Algebraic ordinals. Fundam. Inform. 99(4), 383–407 (2010)

    Article  MathSciNet  Google Scholar 

  2. Bloom, S.L., Ésik, Z.: The equational theory of regular words. Inf. Comput. 197(1), 55–89 (2005)

    Article  MathSciNet  Google Scholar 

  3. Ésik, Z.: Scattered context-free linear orderings. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 216–227. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22321-1_19

    Chapter  Google Scholar 

  4. Ésik, Z.: An undecidable property of context-free linear orders. Inf. Process. Lett. 111(3), 107–109 (2011)

    Article  Google Scholar 

  5. Ésik, Z., Iván, S.: Hausdorff rank of scattered context-free linear orders. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 291–302. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29344-3_25

    Chapter  Google Scholar 

  6. Gelle, K., Iván, S.: On the order type of scattered context-free orderings. In: The Tenth International Symposium on Games, Automata, Logics, and Formal Verification, September 2–3, 2019, pp. 169–182 (2019)

    Article  Google Scholar 

  7. Gelle, K., Iván, S.: The ordinal generated by an ordinal grammar is computable. Theoret. Comput. Sci. 793, 1–13 (2019)

    Article  MathSciNet  Google Scholar 

  8. Heilbrunner, S.: An algorithm for the solution of fixed-point equations for infinite words. RAIRO - Theoret. Inf. Appl. Informatique Théorique et Applications 14(2), 131–141 (1980)

    Article  MathSciNet  Google Scholar 

  9. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading (1979)

    MATH  Google Scholar 

  10. Lohrey, M., Mathissen, C.: Isomorphism of regular trees and words. Inf. Comput. 224, 71–105 (2013)

    Article  MathSciNet  Google Scholar 

  11. Rosenstein, J.: Linear Orderings. Pure and Applied Mathematics. Elsevier Science, Amsterdam (1982)

    MATH  Google Scholar 

  12. Stark, J.A.: Ordinal arithmetic (2015). https://jalexstark.com/notes/OrdinalArithmetic.pdf

  13. Thomas, W.: On frontiers of regular trees. ITA 20(4), 371–381 (1986)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

Ministry of Human Capacities, Hungary grant 20391-3/2018/FEKUSTRAT is acknowledged. Szabolcs Iván was supported by the János Bolyai Scholarship of the Hungarian Academy of Sciences. Kitti Gelle was supported by the ÚNKP-19-3-SZTE-86 New National Excellence Program of the Ministry of Human Capacities.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Szeged, Szeged, Hungary

    Kitti Gelle & Szabolcs Iván

Authors
  1. Kitti Gelle
    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

Corresponding author

Correspondence to Szabolcs Iván .

Editor information

Editors and Affiliations

  1. University of Macedonia, Thessaloniki, Greece

    Alexander Chatzigeorgiou

  2. University of Bergamo, Bergamo, Italy

    Riccardo Dondi

  3. Cyprus University of Technology, Limassol, Cyprus

    Herodotos Herodotou

  4. Carnegie Mellon University Qatar, Doha, Qatar

    Christos Kapoutsis

  5. Open University of Cyprus, Nicosia, Cyprus

    Yannis Manolopoulos

  6. University of Cyprus, Nicosia, Cyprus

    George A. Papadopoulos

  7. Paris Dauphine University, Paris, France

    Florian Sikora

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gelle, K., Iván, S. (2020). The Order Type of Scattered Context-Free Orderings of Rank One Is Computable. In: Chatzigeorgiou, A., et al. SOFSEM 2020: Theory and Practice of Computer Science. SOFSEM 2020. Lecture Notes in Computer Science(), vol 12011. Springer, Cham. https://doi.org/10.1007/978-3-030-38919-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-38919-2_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-38918-5

  • Online ISBN: 978-3-030-38919-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation