Trace languages defined by regular string languages

DOI10.1051/ita/1986200201031zbMath0612.68071OpenAlexW23422391MaRDI QIDQ3753510

Ijsbrand Jan Aalbersberg, Ermo Welzl

Publication date: 1986

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92250

zbMATH Keywords

decidabilityclosure propertiesconcurrent alphabetconcurrency relationexistentially regular trace languagesuniversally regular trace languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Traces, dependency graphs and DNLC grammars, On the structure of recognizable languages of dependence graphs, Two techniques in the area of the star problem in trace monoids, Generalized rational relations and their logical definability, On regular trace languages, Mixed product and asynchronous automata, Theory of traces, Complete subgraphs of bipartite graphs and applications to trace languages, Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems), Reordering Derivatives of Trace Closures of Regular Languages., Probabilistic estimation of the number of prefixes of a trace, On the decidability of the equivalence problem for partially commutative rational power series, Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications, Characterizations of the decidability of some problems for regular trace languages

Cites Work

• Traces, dependency graphs and DNLC grammars
• Matrices de Hankel
• An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item