scientific article; zbMATH DE number 3918680

MaRDI QIDQ3695482zbMATH OpenFDO

Authors Christophe Reutenauer

Publication date 1985

Full work available at URL https://eudml.org/doc/92234

zbMATH Keywords

free productrational and recognizable subsets

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• Slightly commutative Kleene semigroups
• Easy multiplications. I: The realm of Kleene's theorem
• On commutative Kleene monoids
• Crossability of cancellative Kleene semigroups
• Which Kleene semigroups are finite?

Cites work

• scientific article; zbMATH DE number 3912630 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3309240 (Why is no real title available?)
• A Characterization of Machine Mappings

Cited in

(7)

• Easy multiplications. II: Extensions of rational semigroups
• On regular trace languages
• Which Kleene semigroups are finite?
• Slightly commutative Kleene semigroups
• Equidivisible Kleene monoids and the Elgot-Mezei theorem
• A finiteness criterion for inverse semigroups
• On finitely recognizable semigroups

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