The applications of solid codes to r-R and r-D languages
Sign Up to like & getrecommendations! Published in 2019 at "Soft Computing"
DOI: 10.1007/s00500-019-04012-4
Abstract: A language S on a free monoid $$A^*$$A∗ is called a solid code if S is an infix code and overlap-free. A congruence $$\rho $$ρ on $$A^*$$A∗ is called principal if there exists $$L\subseteq A^*$$L⊆A∗… read more here.
Keywords: solid codes; mathbf; mathbf mathbf; applications solid ... See more keywords