Regular Languages of Words over Countable Linear Orderings
From MaRDI portal
Publication:3012914
DOI10.1007/978-3-642-22012-8_9zbMath1333.68186OpenAlexW103770413MaRDI QIDQ3012914
Gabriele Puppis, Thomas Colcombet, Olivier Carton
Publication date: 7 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.712.6475
Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Total orders (06A05)
Related Items (8)
Equational Theories of Scattered and Countable Series-Parallel Posets ⋮ Limited Set quantifiers over Countable Linear Orderings ⋮ Recognisable Languages over Monads ⋮ Unnamed Item ⋮ Pro-aperiodic monoids via saturated models ⋮ Unnamed Item ⋮ The factorisation forest theorem ⋮ On the Weihrauch degree of the additive Ramsey theorem over the rationals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factorization forests for infinite words and applications to countable scattered linear orderings
- Automata on linear orderings
- Logic and rational languages of words indexed by linear orderings
- The monadic theory of order
- The first order properties of products of algebraic systems
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
- Decidability of Second-Order Theories and Automata on Infinite Trees
This page was built for publication: Regular Languages of Words over Countable Linear Orderings
