scientific article; zbMATH DE number 1405660

MaRDI QIDQ4938641zbMATH OpenFDO

Authors Daniel Kirsten

Publication date 2 August 2000

zbMATH Keywords

congruencesrecognizable languagestrace monoidsfree monoidstrace languagesstar problemfinite power property

Mathematics Subject Classification ID

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

Recommendations

• The star problem and the finite power property in trace monoids: Reductions beyond C4
• Some trace monoids where both the star problem and the finite power property problem are decidable (extended abstract)
• Decidability equivalence between the star problem and the finite power problem in trace monoids
• New results on the star problem in trace monoids
• scientific article; zbMATH DE number 1754623
• scientific article; zbMATH DE number 1304323
• Two techniques in the area of the star problem in trace monoids
• On the monoid of partial isometries of a finite star graph
• scientific article; zbMATH DE number 4031964
• ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS

Cited in

(8)

• The star problem and the finite power property in trace monoids: Reductions beyond C4
• A Star Operation for Star-Free Trace Languages
• New results on the star problem in trace monoids
• Star-free star and trace languages
• ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS
• scientific article; zbMATH DE number 1405661 (Why is no real title available?)
• The homomorphism problem for trace monoids.
• scientific article; zbMATH DE number 1304323 (Why is no real title available?)

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 Q4938641)