On the groups of codes with empty kernel. (Q982209): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00233-010-9214-5 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00233-010-9214-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1975783797 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3653240 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for computing finite semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3853827 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the synchronizing properties of certain prefix codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4046274 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5512231 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00233-010-9214-5 / rank | |||
Normal rank |
Latest revision as of 11:08, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the groups of codes with empty kernel. |
scientific article |
Statements
On the groups of codes with empty kernel. (English)
0 references
6 July 2010
0 references
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)].
0 references
codes
0 references
kernels of sets of words
0 references
syntactic semigroups
0 references
finite automata
0 references
internal factors
0 references