References

1. Stephen L. Bloom & Zoltán Ésik (2009): Scattered Algebraic Linear Orderings. In: 6th Workshop on Fixed Points in Computer Science, FICS 2009, Coimbra, Portugal, September 12-13, 2009., pp. 25–29.
2. Stephen L. Bloom & Zoltán Ésik (2010): Algebraic Ordinals. Fundam. Inform. 99(4), pp. 383–407, doi:10.3233/FI-2010-255.
3. Stephen L. Bloom & Zoltán Ésik (2005): The equational theory of regular words. Information and Computation 197(1), pp. 55 – 89, doi:10.1016/j.ic.2005.01.004.
4. Stephen L. Bloom & Zoltán Ésik (2011): Algebraic linear orderings. International Journal of Foundations of Computer Science 22(02), pp. 491–515, doi:10.1142/S0129054111008155.
5. Bruno Courcelle (1983): Fundamental properties of infinite trees. Theoretical Computer Science 25(2), pp. 95 – 169, doi:10.1016/0304-3975(83)90059-2.
6. Zoltán Ésik (2011): Scattered Context-Free Linear Orderings. In: Giancarlo Mauri & Alberto Leporati: Developments in Language Theory. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 216–227, doi:10.1017/CBO9780511566097.
7. Zoltán Ésik (2011): An undecidable property of context-free linear orders. Information Processing Letters 111(3), pp. 107 – 109, doi:10.1016/j.ipl.2010.10.018.
8. Zoltán Ésik & Szabolcs Iván (2012): Hausdorff Rank of Scattered Context-Free Linear Orders. In: David Fernández-Baca: LATIN 2012: Theoretical Informatics. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 291–302, doi:10.1112/plms/s3-4.1.177.
9. Kitti Gelle & Szabolcs Iván: The ordinal generated by an ordinal grammar is computable. Theoretical Computer Science, doi:10.1016/j.tcs.2019.04.016. Available at https://arxiv.org/abs/1811.03595. To appear..
10. Stephan Heilbrunner (1980): An algorithm for the solution of fixed-point equations for infinite words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 14(2), pp. 131–141, doi:10.1051/ita/1980140201311.
11. John E. Hopcroft & Jeff D. Ullman (1979): Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company.
12. Christos H. Papadimitriou (1994): Computational complexity.. Addison-Wesley.
13. J.G. Rosenstein (1982): Linear Orderings. Pure and Applied Mathematics. Elsevier Science.
14. Jacob Alexander Stark (2015): Ordinal Arithmetic. Available at https://jalexstark.com/notes/OrdinalArithmetic.pdf.
15. Wolfgang Thomas (1986): On Frontiers of Regular Trees. ITA 20(4), pp. 371–381, doi:10.1051/ita/1986200403711.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org