On the groups of codes with empty kernel.

DOI10.1007/s00233-010-9214-5zbMath1202.20071OpenAlexW1975783797MaRDI QIDQ982209

Jean Berstel, Dominique Perrin, Clelia De Felice, Giuseppina Rindone

Publication date: 6 July 2010

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-010-9214-5

zbMATH Keywords

finite automatacodesinternal factorskernels of sets of wordssyntactic semigroups

Mathematics Subject Classification ID

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

Related Items (1)

Recent results on syntactic groups of prefix codes.

Cites Work

• Algorithms for computing finite semigroups
• On the synchronizing properties of certain prefix codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the groups of codes with empty kernel.