Star-free sets of words on ordinals

DOI10.1006/inco.2000.3009zbMath1007.68095OpenAlexW2005848337MaRDI QIDQ1854423

Nicolas Bedon

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.3009

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (3)

Schützenberger and Eilenberg theorems for words on linear orderings ⋮ COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS ⋮ Logic over words on denumerable ordinals

Cites Work

• First-order logic and star-free sets
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Finite automata and ordinals
• Logic over words on denumerable ordinals
• Logic, semigroups and automata on words
• An application of games to the completeness problem for formalized theories
• Weak Second‐Order Arithmetic and Finite Automata
• Application of model theoretic games to discrete linear orders and finite automata
• Star-free regular sets of ω-sequences
• Automata, Semigroups and Recognizability of Words on Ordinals
• On finite monoids having only trivial subgroups
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Star-free sets of words on ordinals