scientific article
From MaRDI portal
Publication:4035660
zbMath0773.68046MaRDI QIDQ4035660
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
concurrent systemsclosure propertiestracesrecognizable languagesrational languagessyntactic congruence
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (11)
Deterministic asynchronous automata for infinite traces ⋮ On the complementation of asynchronous cellular Büchi automata ⋮ Agreeing within a few writes ⋮ On the complementation of Büchi asynchronous cellular automata ⋮ Logical definability on infinite traces ⋮ On the concatenation of infinite traces ⋮ The poset of infinitary traces ⋮ Asynchronous cellular automata for infinite traces ⋮ Logical definability on infinite traces ⋮ An extension of Kleene's and Ochmański's theorems to infinite traces ⋮ Recognizable trace languages, distributed automata and the distribution problem
This page was built for publication:
