Towards a language theory for infinite N-free pomsets.

DOI10.1016/S0304-3975(02)00370-5zbMath1040.68055MaRDI QIDQ1874399

Dietrich Kuske

Publication date: 25 May 2003

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

zbMATH Keywords

recognizable languagesfinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Equational Theories of Scattered and Countable Series-Parallel Posets ⋮ Axiomatizing the identities of binoid languages ⋮ Series-parallel languages on scattered and countable posets ⋮ Branching automata with costs -- a way of reflecting parallelism in costs ⋮ Algebraic and graph-theoretic properties of infiniten-posets ⋮ Complementation of Branching Automata for Scattered and Countable N-Free Posets ⋮ Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings ⋮ Logic and rational languages of scattered and countable series-parallel posets ⋮ Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets ⋮ Pomset Languages of Finite Step Transition Systems ⋮ The recognizability of sets of graphs is a robust property

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modeling concurrency with partial orders
• The equational theory of pomsets
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• The monadic theory of order
• Monadic second-order definable graph transductions: a survey
• Modulo-counting quantifiers over finite trees
• Monadic second-order definable text languages
• Series-parallel languages and the bounded-width property
• Axiomatizing the subsumption and subword preorders on finite and infinite partial words
• Rationality in algebras with a series operation
• Modest theory of short chains. I
• A combinatorial approach to the theory of ω-automata
• Application of model theoretic games to discrete linear orders and finite automata
• Star-free regular sets of ω-sequences
• Recognizability equals definability for partial k-paths
• On finite monoids having only trivial subgroups

This page was built for publication: Towards a language theory for infinite N-free pomsets.