ALGEBRAIC LINEAR ORDERINGS

DOI10.1142/S0129054111008155zbMath1227.18002OpenAlexW2129772766MaRDI QIDQ3086252

Zoltán Ésik, Stephen L. Bloom

Publication date: 30 March 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111008155

zbMATH Keywords

fixed point equationslinear orderingscontext-free linear and well-orderings

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Special categories (18B99) Recursive ordinals and ordinal notations (03F15)

Related Items (7)

A note on ordinal DFAs ⋮ An undecidable property of context-free linear orders ⋮ Unnamed Item ⋮ Isomorphism of Regular Trees and Words ⋮ ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS ⋮ The ordinal generated by an ordinal grammar is computable ⋮ The isomorphism problem on classes of automatic structures with transitive relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mezei-Wright theorem for categorical algebras
• Fundamental properties of infinite trees
• The IO- and OI-hierarchies
• On direct products of automaton decidable theories
• Fixed-point constructions in order-enriched categories
• The equational theory of regular words
• On infinite transition graphs having a decidable monadic theory
• Automaticity of ordinals and of homogeneous graphs
• n-Rational Algebras I. Basic Properties and Free Algebras
• Initial Algebra Semantics and Continuous Algebras
• Algebraic automata and context-free sets
• Long words: The theory of concatenation and \(\omega\)-power

This page was built for publication: ALGEBRAIC LINEAR ORDERINGS