scientific article; zbMATH DE number 1136090

zbMath0892.68041MaRDI QIDQ4381401

Kamal Lodaya, Pascal Weil

Publication date: 1 April 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bounded widthbranching automaton

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (15)

Towards a language theory for infinite N-free pomsets. ⋮ Concurrent Kleene algebra with tests and branching automata ⋮ Nested-unit Petri nets ⋮ Reachability analysis of reversal-bounded automata on series-parallel graphs ⋮ Series-parallel languages on scattered and countable posets ⋮ Retractions onto series-parallel 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 ⋮ Confluent Hasse Diagrams ⋮ Unnamed Item ⋮ Logic and rational languages of scattered and countable series-parallel posets ⋮ Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets ⋮ Asynchronous cellular automata for pomsets ⋮ Rationality in algebras with a series operation ⋮ Axiomatizing the subsumption and subword preorders on finite and infinite partial words

This page was built for publication: