Abstract
We continue the investigation, [9,11,5,1,2], of representing a language as a catenation of languages, each of which cannot be further decomposed in a nontrivial fashion. We study such prime decompositions, both finite and infinite ones. The notion of a length code, an extension of the notion of a code leads to general results concerning decompositions of star languages. Special emphasis is on the decomposition of regular languages. Also some open problems are mentioned. © 2008 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Salomaa, A., Salomaa, K., & Yu, S. (2008). Length codes, products of languages and primality. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5196 LNCS, pp. 476–486). https://doi.org/10.1007/978-3-540-88282-4_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
