A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
From MaRDI portal
Publication:5483372
Recommendations
Cites work
Cited in
(15)- scientific article; zbMATH DE number 1870548 (Why is no real title available?)
- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
- scientific article; zbMATH DE number 1972806 (Why is no real title available?)
- scientific article; zbMATH DE number 622491 (Why is no real title available?)
- Hierarchy among automata on linear orderings
- Automata on linear orderings
- OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs
- Developments in Language Theory
- On the Kleijn-Rozenberg k-adjacent languages
- scientific article; zbMATH DE number 1834651 (Why is no real title available?)
- Logic and Rational Languages of Words Indexed by Linear Orderings
- Series-parallel languages on scattered and countable posets
- On expressive power of regular expressions over infinite orders
- Logic and rational languages of words indexed by linear orderings
- Non-emptiness test for automata over words indexed by the reals and rationals
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)