Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings

DOI10.1007/978-3-540-92687-0_5zbMath1211.03059OpenAlexW2169691751MaRDI QIDQ3605520

Nicolas Bedon

Publication date: 24 February 2009

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92687-0_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (4)

Series-parallel languages on scattered and countable posets ⋮ 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

• The monadic theory of order
• Series-parallel languages and the bounded-width property
• Rationality in algebras with a series operation
• Towards a language theory for infinite N-free pomsets.
• Logic and Rational Languages of Words Indexed by Linear Orderings
• Series-Parallel Languages on Scattered and Countable Posets
• The Recognition of Series Parallel Digraphs
• COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
• A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings