On the groups of codes with empty kernel.

DOI10.1007/S00233-010-9214-5zbMATH Open1202.20071OpenAlexW1975783797MaRDI QIDQ982209FDOQ982209

Authors: Jean Berstel, Clelia De Felice, Dominique Perrin, 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

Recommendations

• On the structure of some group codes
• Groups in the syntactic monoid of a composed code
• The syntactic monoid of the semigroup generated by a maximal prefix code
• Completely simple codes
• Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups)

zbMATH Keywords

codesfinite automatainternal 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Codes and automata.
• Algorithms for computing finite semigroups
• On the synchronizing properties of certain prefix codes
• Title not available (Why is that?)

Cited In (1)

• Recent results on syntactic groups of prefix codes.

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

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