Ordinal automata and Cantor normal form

DOI10.1142/S0129054112400060zbMATH Open1279.68150OpenAlexW1988719317MaRDI QIDQ2909183FDOQ2909183

Authors: Zoltán Ésik 

Publication date: 30 August 2012

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

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

Recommendations

• Representing small ordinals by finite automata
• A note on ordinal DFAs
• Determinization of ordinal automata
• Finite automata and ordinals
• Automata on ordinals and automaticity of linear orders

zbMATH Keywords

ordinalregular languagefinite automatonlexicographic ordering

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• The equational theory of regular words
• An undecidable property of context-free linear orders

Cited In (8)

• The ordinal generated by an ordinal grammar is computable
• Pumping for ordinal-automatic structures1
• A note on ordinal DFAs
• NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
• Isomorphism of regular trees and words
• Representing small ordinals by finite automata
• Determinization of ordinal automata
• Ordinal machines and admissible recursion theory

This page was built for publication: Ordinal automata and Cantor normal form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909183)