Flow languages equal recursively enumerable languages
From MaRDI portal
Publication:1151054
DOI10.1007/BF00289261zbMath0456.68093MaRDI QIDQ1151054
Publication date: 1981
Published in: Acta Informatica (Search for Journal in Brave)
Related Items
Literal shuffle, Regularity Conditions for Iterated Shuffle on Commutative Regular Languages, On the expressive power of the shuffle operator matched with intersection by regular sets, Relations of flow languages to Petri net languages, A P-complete language describable with iterated shuffle, On the enlargement of the class of regular languages by the shuffle closure, Shuffle and scattered deletion closure of languages, Algèbre de processus et synchronisation, Extending regular expressions with iterated shuffle, Characterization and complexity results on jumping finite automata
Cites Work
