A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS

DOI10.1142/S0129054106003978zbMATH Open1096.68079OpenAlexW2006097526MaRDI QIDQ5483372FDOQ5483372

Authors: 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

Recommendations

• Developments in Language Theory
• Automata on linear orderings
• scientific article; zbMATH DE number 1834651
• Hierarchy among automata on linear orderings
• Developments in Language Theory

zbMATH Keywords

automataorderings

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

Cited In (14)

• Series-parallel languages on scattered and countable posets
• Developments in Language Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs
• Automata on linear orderings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic and rational languages of words indexed by linear orderings
• Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
• On the Kleijn-Rozenberg k-adjacent languages
• Logic and Rational Languages of Words Indexed by Linear Orderings
• Non-emptiness test for automata over words indexed by the reals and rationals
• Hierarchy among automata on linear orderings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483372)