Decidability equivalence between the star problem and the finite power problem in trace monoids
From MaRDI portal
Publication:5945722
DOI10.1007/S00224-001-0006-XzbMath0988.68105OpenAlexW2087759875MaRDI QIDQ5945722
No author found.
Publication date: 22 July 2002
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://tud.qucosa.de/id/qucosa%3A26303
Related Items (3)
Two techniques in the area of the star problem in trace monoids ⋮ The finite power problem revisited. ⋮ The star problem and the finite power property in trace monoids: Reductions beyond C4
This page was built for publication: Decidability equivalence between the star problem and the finite power problem in trace monoids
