A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS

DOI10.1142/S0129054106003978zbMath1096.68079OpenAlexW2006097526MaRDI QIDQ5483372

Alexis Bès, Olivier Carton

Publication date: 14 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054106003978

zbMATH Keywords

automataorderings

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Series-parallel languages on scattered and countable posets ⋮ Logic and rational languages of words indexed by linear orderings ⋮ Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings ⋮ OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs

Cites Work

• Finite divergence
• Bilimites de langages reconnaissables
• The monadic theory of order
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Star free expressions over the reals
• Weak Second‐Order Arithmetic and Finite Automata
• On frontiers of regular trees

This page was built for publication: A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS