Ordinal automata and Cantor normal form

DOI10.1142/S0129054112400060MaRDI QIDQ2909183zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

ordinalregular languagefinite automatonlexicographic ordering

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(8)

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

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)