Infinite series-parallel posets: Logic and languages

DOI10.1007/3-540-45022-X_55MaRDI QIDQ2754184zbMATH OpenFDO

Authors Dietrich Kuske

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45022-X_55

zbMATH Keywords

labeled partially ordered sets

Mathematics Subject Classification ID

Partial orders, general (06A06) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Towards a language theory for infinite N-free pomsets.
• Series-parallel posets: Algebra, automata and languages
• Series-Parallel Languages on Scattered and Countable Posets
• Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings

Cited in

(19)

• Series-parallel languages and the bounded-width property
• Two equational theories of partial words
• Rationality in algebras with a series operation
• Towards a language theory for infinite N-free pomsets.
• Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
• Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
• Communicating finite-state machines and two-variable logic
• Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
• Sequential theories and infinite distributivity in the lattice of chapters
• Series-parallel posets: Algebra, automata and languages
• Algebraic and graph-theoretic properties of infiniten-posets
• Complementation of Branching Automata for Scattered and Countable N-Free Posets
• Recognizable sets of N-free pomsets are monadically axiomatizable
• Automata on series-parallel biposets
• Series-parallel languages on scattered and countable posets
• On two-variable first-order logic with a partial order
• Logic and languages of higher-dimensional automata
• Higher-dimensional automata: extension to infinite tracks
• Axiomatizing the identities of binoid languages

This page was built for publication: Infinite series-parallel posets: Logic and languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754184)