ORDINAL AUTOMATA AND CANTOR NORMAL FORM

DOI10.1142/S0129054112400060zbMath1279.68150OpenAlexW1988719317MaRDI QIDQ2909183

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)

Cites Work

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

This page was built for publication: ORDINAL AUTOMATA AND CANTOR NORMAL FORM