Trace languages defined by regular string languages

DOI10.1051/ITA/1986200201031MaRDI QIDQ3753510zbMATH OpenOpenAlexFDO

Authors Ijsbrand Jan Aalbersberg, Emo 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)

Recommendations

• Characterizations of the decidability of some problems for regular trace languages
• scientific article; zbMATH DE number 4035114
• On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
• Notes on finite asynchronous automata
• Membership problems for regular and context-free trace languages

Cites work

• scientific article; zbMATH DE number 3808972 (Why is no real title available?)
• scientific article; zbMATH DE number 3921989 (Why is no real title available?)
• scientific article; zbMATH DE number 3924146 (Why is no real title available?)
• scientific article; zbMATH DE number 3970130 (Why is no real title available?)
• scientific article; zbMATH DE number 4020497 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3765174 (Why is no real title available?)
• scientific article; zbMATH DE number 3765179 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3307592 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
• Matrices de Hankel
• Traces, dependency graphs and DNLC grammars

Cited in

(19)

• Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
• Two techniques in the area of the star problem in trace monoids
• Complete subgraphs of bipartite graphs and applications to trace languages
• Reordering Derivatives of Trace Closures of Regular Languages.
• On the structure of recognizable languages of dependence graphs
• Characterizations of the decidability of some problems for regular trace languages
• On regular trace languages
• Theory of traces
• scientific article; zbMATH DE number 4035114 (Why is no real title available?)
• Disjointness, inclusion, and regularity of -rational trace languages (extended abstract)
• Generalized rational relations and their logical definability
• Probabilistic estimation of the number of prefixes of a trace
• Mixed product and asynchronous automata
• Traces, dependency graphs and DNLC grammars
• On the decidability of the equivalence problem for partially commutative rational power series
• Reachability in trace-pushdown systems
• scientific article; zbMATH DE number 3848633 (Why is no real title available?)
• scientific article; zbMATH DE number 4116001 (Why is no real title available?)
• Automated synthesis of application-layer connectors from automata-based specifications

This page was built for publication: Trace languages defined by regular string languages

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