A note on ordinal DFAs

DOI10.1007/S11083-011-9233-1zbMath1261.68080OpenAlexW1618951114MaRDI QIDQ1943687

Stephen L. Bloom, Yi Di Zhang

Publication date: 20 March 2013

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-011-9233-1

zbMATH Keywords

lexicographic orderregular ordinaldeterministic finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Total orders (06A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mezei-Wright theorem for categorical algebras
• Fundamental properties of infinite trees
• A representation of trees by languages. I
• Fixed-point constructions in order-enriched categories
• Automaticity of ordinals and of homogeneous graphs
• ALGEBRAIC LINEAR ORDERINGS
• Algebraic Ordinals
• Scattered Context-Free Linear Orderings
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Long words: The theory of concatenation and \(\omega\)-power

This page was built for publication: A note on ordinal DFAs