Trace languages defined by regular string languages
From MaRDI portal
Publication:3753510
DOI10.1051/ITA/1986200201031zbMATH Open0612.68071OpenAlexW23422391MaRDI QIDQ3753510FDOQ3753510
Emo Welzl, Ijsbrand Jan Aalbersberg
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
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
decidabilityclosure propertiesconcurrent alphabetconcurrency relationexistentially regular trace languagesuniversally regular trace languages
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrices de Hankel
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Traces, dependency graphs and DNLC grammars
- Title not available (Why is that?)
Cited In (17)
- Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
- Complete subgraphs of bipartite graphs and applications to trace languages
- Two techniques in the area of the star problem in trace monoids
- 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
- Title not available (Why is that?)
- Generalized rational relations and their logical definability
- Mixed product and asynchronous automata
- Probabilistic estimation of the number of prefixes of a trace
- Traces, dependency graphs and DNLC grammars
- On the decidability of the equivalence problem for partially commutative rational power series
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
