Automata on linear orderings
From MaRDI portal
Publication:859978
DOI10.1016/J.JCSS.2006.10.009zbMATH Open1178.68307OpenAlexW2056871658MaRDI QIDQ859978FDOQ859978
Authors: Olivier Carton, Véronique Bruyère 
Publication date: 22 January 2007
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.2006.10.009
Recommendations
Cites Work
- Title not available (Why is that?)
- Weak Second‐Order Arithmetic and Finite Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- $ℵ_0$-categoricity of linear orderings
- The monadic theory of order
- Title not available (Why is that?)
- Title not available (Why is that?)
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
- On frontiers of regular trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Developments in Language Theory
- Finite divergence
- Bilimites de langages reconnaissables
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (32)
- An Analysis of the Fuller Phenomenon on Transfinite Hybrid Automata
- Tree Automata and Automata on Linear Orderings
- A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
- Title not available (Why is that?)
- Logic and rational languages of scattered and countable series-parallel posets
- Developments in Language Theory
- Title not available (Why is that?)
- Factorization forests for infinite words and applications to countable scattered linear orderings
- Title not available (Why is that?)
- Title not available (Why is that?)
- OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs
- On context-free languages of scattered words
- An algebraic approach to MSO-definability on countable linear orderings
- Craig Interpolation for Linear Temporal Languages
- Schützenberger and Eilenberg theorems for words on linear orderings
- Automata on ordinals and automaticity of linear orders
- MSO-definable properties of Muller context-free languages are decidable
- Automata on Ordinals and Linear Orders
- Universal first-order quantification over automata
- Logic and rational languages of words indexed by linear orderings
- Developments in Language Theory
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
- Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates
- Regular languages of words over countable linear orderings
- On defining linear orders by automata
- Equational descriptions of languages
- On Müller context-free grammars
- Büchi context-free languages
- Non-emptiness test for automata over words indexed by the reals and rationals
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- Complementation of rational sets on scattered linear orderings of finite rank
- Hierarchy among automata on linear orderings
This page was built for publication: Automata on linear orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859978)
