scientific article; zbMATH DE number 4020497
From MaRDI portal
Publication:3763601
Recommendations
- On regular trace languages
- On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
- Characterizations of the decidability of some problems for regular trace languages
- scientific article; zbMATH DE number 4051029
- scientific article; zbMATH DE number 3848633
Cited in
(15)- On regular trace languages
- Theory of traces
- On the decidability of the equivalence problem for partially commutative rational power series
- On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
- Two techniques in the area of the star problem in trace monoids
- The generalized rank of trace languages
- Unambiguous recognizable two-dimensional languages
- Unambiguity in Timed Regular Languages: Automata and Logics
- Trace languages defined by regular string languages
- Characterizations of the decidability of some problems for regular trace languages
- Logical definability of some rational trace languages
- scientific article; zbMATH DE number 7561705 (Why is no real title available?)
- Toward a Structure Theory of Regular Infinitary Trace Languages
- Developments in Language Theory
- Reordering Derivatives of Trace Closures of Regular Languages.
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 Q3763601)
