Automata on ordinals and automaticity of linear orders

DOI10.1016/j.apal.2012.11.007zbMath1285.03050OpenAlexW2084168663MaRDI QIDQ1944328

Philipp Schlicht, Frank Stephan

Publication date: 5 April 2013

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2012.11.007

zbMATH Keywords

infinite input tapelimit ordinal input tapelimit transition functionnon-automaticity of linear ordersrecognition by finite automata

Mathematics Subject Classification ID

Partial orders, general (06A06) Automata and formal grammars in connection with logical questions (03D05) Computable structure theory, computable model theory (03C57) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

Tree-automatic scattered linear orders ⋮ Space-bounded OTMs and REG ∞ ⋮ Pumping for ordinal-automatic structures1 ⋮ The isomorphism problem for tree-automatic ordinals with addition

This page was built for publication: Automata on ordinals and automaticity of linear orders