
doi: 10.1007/bf02573310
A prefix code P over X is said to be r-extensible if for every uv\(\in P\) and \(x\in X^*\) there exists \(s\in X^*\) such that \(uxv=ts\) for some \(t\in P\). An ideal I of \(X^*\) is said to be cs-prime if \(x^ 2\in I\) implies that \(x\in I\). In this note, a necessary and sufficient condition for an r-extensible prefix code to be finite is given. The class of all r-extensible prefix codes generating cs-prime ideals is constructed.
cs-prime ideals, 510.mathematics, Ideal theory for semigroups, r-extensible prefix code, Semigroups in automata theory, linguistics, etc., Formal languages and automata, Article
cs-prime ideals, 510.mathematics, Ideal theory for semigroups, r-extensible prefix code, Semigroups in automata theory, linguistics, etc., Formal languages and automata, Article
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
