Two techniques in the area of the star problem
From MaRDI portal
Trace monoids of the form \(\Sigma^*\times\Gamma^*\) for two disjoint alphabets \(\Sigma\), \(\Gamma\) are studied. The elements of the set \(\Sigma^*\times\Gamma^*\) are called traces and its subsets are trace languages. The recognizability of a trace language by an automaton is defined. The star problem is the problem, whether the language \(P^*\) for a recognizable language \(P\) is recognizable. This problem remains open and the paper contains some partial results in this direction. For the entire collection see [Zbl 0917.00014].
Recommendations
- A connection between the star problem and the finite power property in trace monoids. (Extended abstract)
- Two techniques in the area of the star problem in trace monoids
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
- The star problem in trace monoids: Reductions beyond C4 (extended abstract)
- New results on the star problem in trace monoids
Cited in
(9)- Star matching and distance two labelling
- Two techniques in the area of the star problem in trace monoids
- Some Variants of the Star Height Problem
- scientific article; zbMATH DE number 8897 (Why is no real title available?)
- The star problem in trace monoids: Reductions beyond C4 (extended abstract)
- Some trace monoids where both the star problem and the finite power property problem are decidable (extended abstract)
- LAZARD'S ELIMINATION (IN TRACES) IS FINITE-STATE RECOGNIZABLE
- A Star Operation for Star-Free Trace Languages
- Star-free star and trace languages
This page was built for publication: Two techniques in the area of the star problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938642)
