Representing small ordinals by finite automata

MaRDI QIDQ4964012zbMATH OpenFDO

Authors Zoltán Ésik

Publication date 24 February 2021

Full work available at URL https://arxiv.org/abs/1008.1650, http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCFS2010.10

Mathematics Subject Classification ID

Ordinal and cardinal numbers (03E10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Ordinal automata and Cantor normal form
• A note on ordinal DFAs
• Determinization of ordinal automata
• scientific article; zbMATH DE number 3992941
• Finite automata and ordinals

Cited in

(7)

• Finite automata and ordinals
• A note on ordinal DFAs
• Isomorphism of regular trees and words
• The ordinal generated by an ordinal grammar is computable
• Ordinal automata and Cantor normal form
• scientific article; zbMATH DE number 3992941 (Why is no real title available?)
• Space-bounded OTMs and REG ∞

This page was built for publication: Representing small ordinals by finite automata

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