Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets

DOI10.1007/978-3-662-53132-7_2zbMath1436.68160OpenAlexW2488512903MaRDI QIDQ2817372

Nicolas Bedon

Publication date: 30 August 2016

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53132-7_2

zbMATH Keywords

automatacommutative monoidsseries-parallel posetstransfinite N-free posetsSP-rational languages

Mathematics Subject Classification ID

Partial orders, general (06A06) Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Two equational theories of partial words ⋮ Complementation of Branching Automata for Scattered and Countable N-Free Posets

Cites Work

• Series-parallel languages on scattered and countable posets
• Factorization forests for infinite words and applications to countable scattered linear orderings
• Automata on linear orderings
• Series-parallel languages and the bounded-width property
• Rationality in algebras with a series operation
• Towards a language theory for infinite N-free pomsets.
• Rational sets in commutative monoids
• Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
• Optimal Linear Extensions by Interchanging Chains
• The Recognition of Series Parallel Digraphs
• AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
• COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Logic and Branching Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item