On the existence of the minimum asynchronous automaton and on decision problems for unambiguous regular trace languages
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 334-345
- https://doi.org/10.1007/bfb0035857
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Recent results in the theory of rational setsPublished by Springer Nature ,2005
- An algorithm for computing asynchronous automata in the case of acyclic non-commutation graphsPublished by Springer Nature ,1987
- Decision problems for regular trace languagesPublished by Springer Nature ,1987
- Trace languages defined by regular string languagesRAIRO - Theoretical Informatics and Applications, 1986
- Automates et commutations partiellesRAIRO. Informatique théorique, 1985
- Semantics of concurrent systems: A modular fixed-point trace approachPublished by Springer Nature ,1985
- Equivalence and membership problems for regular trace languagesPublished by Springer Nature ,1982
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languagesLecture Notes in Computer Science, 1981
- Final algebra semantics and data type extensionsJournal of Computer and System Sciences, 1979
- Concurrent Program Schemes and their InterpretationsDAIMI Report Series, 1977