Complementation of Branching Automata for Scattered and Countable N-Free Posets
From MaRDI portal
Publication:4683231
DOI10.1142/S0129054118420042zbMath1403.68110OpenAlexW2888444783WikidataQ129362699 ScholiaQ129362699MaRDI QIDQ4683231
Publication date: 20 September 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054118420042
Related Items (2)
Equational Theories of Scattered and Countable Series-Parallel Posets ⋮ Logic and rational languages of scattered and countable series-parallel posets
Uses Software
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
- Tree acceptors and some of their applications
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
- Weak Second‐Order Arithmetic and Finite Automata
- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
- Optimal Linear Extensions by Interchanging Chains
- Decision Problems of Finite Automata Design and Related Arithmetics
- 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
- Bounded Algol-Like Languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Finite automata and the logic of one-place predicates
- Decidability of Second-Order Theories and Automata on Infinite Trees
- A logical calculus of the ideas immanent in nervous activity
- Logic and Branching Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complementation of Branching Automata for Scattered and Countable N-Free Posets