On the groups of codes with empty kernel.
A word \(v\in A^*\) is an internal factor of a word \(x\in A^*\) iff \(x=uvw\) for some nonempty words \(u,w\). The kernel of a set \(X\subset A^*\) is the set of words from \(X\) which are internal factors of some word from \(X\). It is shown, that if \(X\) is a code with empty kernel, \(F\) the set of internal factors of words from \(X\) and \(\varphi\) the syntactic morphism of the submonoid \(X^*\), then any group \(G\) contained in \(\varphi(A^*\setminus F)\) is cyclic. A subclass of codes with empty kernel are semaphore codes, thus this is a generalization of a result of \textit{M. P. Schützenberger} [Inf. Control 7, 23-26 (1964; Zbl 0122.15004)].
- 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)
- Algorithms for computing finite semigroups
- Codes and automata.
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3460555 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- On the synchronizing properties of certain 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)
