Finite automata and ordinals

DOI10.1016/0304-3975(95)00006-2zbMath0871.68127MaRDI QIDQ1351785

Nicolas Bedon

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00006-2

zbMATH Keywords

Wojciechowski automata

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Automata, Semigroups and Recognizability of Words on Ordinals, ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES, Axiomatizing omega and omega-op powers of words, OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs, A hierarchy of tree-automatic structures, COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS, ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS, Locally finite languages, First-order separation over countable ordinals, Tree-automatic scattered linear orders, Büchi context-free languages, On Müller context-free grammars, Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\), Star-free sets of words on ordinals, Complementation of rational sets on scattered linear orderings of finite rank, MSO-definable Properties of Muller Context-Free Languages Are Decidable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• $ℵ_0$-categoricity of linear orderings
• Decision methods in the theory of ordinals
• Testing and generating infinite sequences by a finite automaton