Series-parallel languages on scattered and countable posets

DOI10.1016/j.tcs.2011.01.016zbMath1238.68072OpenAlexW1991307158MaRDI QIDQ533879

Nicolas Bedon, Chloé Rispal

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.016

zbMATH Keywords

automatalinear orderings\(N\)-free posetssp-rational languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics of partially ordered sets (06A07)

Related Items

Equational Theories of Scattered and Countable Series-Parallel Posets ⋮ Two equational theories of partial words ⋮ Complementation of Branching Automata for Scattered and Countable N-Free Posets ⋮ Logic and rational languages of scattered and countable series-parallel posets ⋮ Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Series-parallel languages and the bounded-width property
• Rationality in algebras with a series operation
• Towards a language theory for infinite N-free pomsets.
• Weak Second‐Order Arithmetic and Finite Automata
• Series-Parallel Languages on Scattered and Countable Posets
• Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
• The Recognition of Series Parallel Digraphs
• A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
• $ℵ_0$-categoricity of linear orderings
• Decidability of Second-Order Theories and Automata on Infinite Trees