scientific article; zbMATH DE number 4035114

MaRDI QIDQ3774928zbMATH OpenFDO

Authors Ijsbrand Jan Aalbersberg, Hendrik Jan Hoogeboom

Publication date 1987

zbMATH Keywords

concurrent systemsdecidabilityequivalence problemindependency relationtrace languages

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Theory of operating systems (68N25) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Characterizations of the decidability of some problems for regular trace languages
• scientific article; zbMATH DE number 4051029
• Membership problems for regular and context-free trace languages
• Trace languages defined by regular string languages
• On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages

Cited in

(10)

• On undecidability of propositional temporal logics on trace systems
• Membership problems for regular and context-free trace languages
• Selected Decision Problems for Square-Refinement Collage Grammars
• scientific article; zbMATH DE number 5722791 (Why is no real title available?)
• Trace languages defined by regular string languages
• scientific article; zbMATH DE number 58306 (Why is no real title available?)
• Decision Problems and Applications of Rational Sets of Regular Languages
• Characterizations of the decidability of some problems for regular trace languages
• SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS
• Some Decision Questions Concerning the Time Complexity of Language Acceptors

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3774928)