Relations of flow languages to Petri net languages
From MaRDI portal
Publication:1158771
DOI10.1016/0304-3975(81)90063-3zbMath0473.68075MaRDI QIDQ1158771
Toshiro Araki, Nobuki Tokura, Toyohiko Kagimasa
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90063-3
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
On the complexity of iterated shuffle, Extending regular expressions with iterated shuffle, Nesting of shuffle closure is important, Infinite hierarchy of expressions containing shuffle closure operator, The equational theory of pomsets
Cites Work