On universality of concurrent expressions with synchronization primitives

DOI10.1016/0304-3975(82)90018-4zbMath0479.68085OpenAlexW2052501965MaRDI QIDQ1162167

S. Singh

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90018-4

zbMATH Keywords

recursively enumerable setsextended regular expressionsshuffle operatorextended model of Shaw's flow expressionssemaphore controlled regular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Artificial intelligence (68T99) Theory of software (68N99)

Related Items

A note on specifying and verifying concurrent processes

Cites Work

• Software Descriptions with Flow Expressions
• Turing machines with restricted memory access
• Unnamed Item
• Unnamed Item