Recognizable trace languages, distributed automata and the distribution problem
From MaRDI portal
Publication:1323363
DOI10.1007/BF01200264zbMath0790.68058MaRDI QIDQ1323363
Publication date: 10 May 1994
Published in: Acta Informatica (Search for Journal in Brave)
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Distribution and synchronized automata
- On regular trace languages
- Theory of traces
- 2-asynchronous automata
- Combinatorics on traces
- Recognizable subsets of some partially Abelian monoids
- Combinatorial problems of commutation and rearrangements
- Notes on finite asynchronous automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item