Schützenberger and Eilenberg theorems for words on linear orderings
DOI10.1016/J.JCSS.2011.06.003zbMATH Open1279.68129OpenAlexW1975463147MaRDI QIDQ414913FDOQ414913
Authors: Nicolas Bedon, Chloé Rispal 
Publication date: 11 May 2012
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2011.06.003
Recommendations
first-order logicvarietiesinfinite wordsrecognizable languagesregular languageslinear orderingsrational languagesstar-free setstransfinite words
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decision methods in the theory of ordinals
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- Weak Second‐Order Arithmetic and Finite Automata
- Title not available (Why is that?)
- First-order logic and star-free sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- $ℵ_0$-categoricity of linear orderings
- Unambiguous Büchi automata.
- Logic over words on denumerable ordinals
- Star-free sets of words on ordinals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
- Developments in Language Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata on linear orderings
Cited In (16)
- Logic and rational languages of scattered and countable series-parallel posets
- Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
- Nonexistence of a Kruskal-Katona type theorem for subword orders
- Simon's theorem for scattered words
- On quasi orders of words and the confluence property
- Recognisable languages over monads
- Logic over words on denumerable ordinals
- First-order separation over countable ordinals
- Star-free sets of words on ordinals
- Ranking and unranking fixed-density necklaces and Lyndon words
- Algebraic characterization of FO for scattered linear orderings
- Lexicographically least words in the orbit closure of the Rudin-Shapiro word
- Developments in Language Theory
- On First-Order Fragments for Words and Mazurkiewicz Traces
- Title not available (Why is that?)
- C-sortable words as green mutation sequences
This page was built for publication: Schützenberger and Eilenberg theorems for words on linear orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414913)
