Automata on linear orderings
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3915652 (Why is no real title available?)
- scientific article; zbMATH DE number 1189233 (Why is no real title available?)
- scientific article; zbMATH DE number 3675332 (Why is no real title available?)
- scientific article; zbMATH DE number 3639170 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 2051168 (Why is no real title available?)
- scientific article; zbMATH DE number 1361474 (Why is no real title available?)
- scientific article; zbMATH DE number 1929934 (Why is no real title available?)
- scientific article; zbMATH DE number 1834651 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3329919 (Why is no real title available?)
- scientific article; zbMATH DE number 3341983 (Why is no real title available?)
- $ℵ_0$-categoricity of linear orderings
- Bilimites de langages reconnaissables
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
- Developments in Language Theory
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
- Finite divergence
- On frontiers of regular trees
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- The monadic theory of order
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(31)- Automata on ordinals and automaticity of linear orders
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- An Analysis of the Fuller Phenomenon on Transfinite Hybrid Automata
- Tree Automata and Automata on Linear Orderings
- An algebraic approach to MSO-definability on countable linear orderings
- Automata on Ordinals and Linear Orders
- Developments in Language Theory
- scientific article; zbMATH DE number 7561320 (Why is no real title available?)
- Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates
- Büchi context-free languages
- Complementation of rational sets on scattered linear orderings of finite rank
- Regular languages of words over countable linear orderings
- Equational descriptions of languages
- Hierarchy among automata on linear orderings
- A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
- OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs
- On Müller context-free grammars
- Developments in Language Theory
- MSO-definable properties of Muller context-free languages are decidable
- Universal first-order quantification over automata
- scientific article; zbMATH DE number 1834651 (Why is no real title available?)
- scientific article; zbMATH DE number 2051168 (Why is no real title available?)
- scientific article; zbMATH DE number 1929934 (Why is no real title available?)
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
- On context-free languages of scattered words
- Logic and rational languages of words indexed by linear orderings
- Schützenberger and Eilenberg theorems for words on linear orderings
- Factorization forests for infinite words and applications to countable scattered linear orderings
- Non-emptiness test for automata over words indexed by the reals and rationals
- On defining linear orders by automata
- Craig Interpolation for Linear Temporal Languages
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)
