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 languages; finite words

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

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

Cites Work

• 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
• 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