Automata on Ordinals and Linear Orders

DOI10.1007/978-3-642-21875-0_27zbMath1259.03053OpenAlexW129887323MaRDI QIDQ3091463

Philipp Schlicht, Frank Stephan

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21875-0_27

Mathematics Subject Classification ID

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

Cites Work

• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Automaticity of ordinals and of homogeneous graphs
• Three Lectures on Automatic Structures
• Automatic linear orders and trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Automata on Ordinals and Linear Orders