scientific article; zbMATH DE number 1405661

MaRDI QIDQ4938642zbMATH OpenFDO

Authors Daniel Kirsten, Jerzy Marcinkowski

Publication date 2 August 2000

zbMATH Keywords

recognizabilitystar problemtrace languagestrace monoids

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1405660
• Two techniques in the area of the star problem in trace monoids
• Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
• scientific article; zbMATH DE number 1754623
• 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?)
• scientific article; zbMATH DE number 1754623 (Why is no real title available?)
• 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:

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