Factorizations of languages and commutativity conditions
AbstractRepresentations of languages as a product (catenation) of languages are investigated, where the factor languages are "prime", that is, cannot be decomposed further in a nontrivial manner. In general, such prime decompositions do not necessarily exist. If they exist, they are not necessarily unique - the number of factors can vary even exponentially. The paper investigates prime decompositions, as well as the commuting of the factors, especially for the case of finite languages. In particular, a technique about commuting is developed in Section 4, where the factorization of languages L1 and L2 is discussed under the assumption L1L2 = L2L1.
Download data is not yet available.
How to Cite
Mateescu, A., Salomaa, A., & Yu, S. (2002). Factorizations of languages and commutativity conditions. Acta Cybernetica, 15(3), 339-351. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3583