scientific article; zbMATH DE number 3641729

MaRDI QIDQ4200990zbMATH OpenFDO

Authors Marcel Paul Schützenberger

Publication date 1979

zbMATH Keywords

free monoidsyntactic monoidabsolutely finite parametersmonoid of interpretations

Mathematics Subject Classification ID

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

Cited in

(18)

• Periods in strings
• scientific article; zbMATH DE number 3901054 (Why is no real title available?)
• scientific article; zbMATH DE number 3693557 (Why is no real title available?)
• Recognizability of morphisms
• Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups)
• On some combinatorial problems in free monoids
• Recent results on syntactic groups of prefix codes.
• On unique factorizations of primitive words.
• Parsing with a finite dictionary
• Codes and Bernoulli partitions
• Bifix codes and Sturmian words
• A string-matching interpretation of the equation x^ m y^ n = z^ p
• Characteristic Sturmian words are extremal for the critical factorization theorem
• Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
• The Ehrenfeucht-Silberger problem
• Synchronization and simplification
• Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
• Periodes et repetitions des mots du monoide libre

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