Finite automata and ordinals

DOI10.1016/0304-3975(95)00006-2zbMath0871.68127OpenAlexW1983547737MaRDI 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

Formal languages and automata (68Q45)

Related Items (16)

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite automata and ordinals