Factorizations of languages and commutativity conditions

Representations 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 necessaril...

Full description

Saved in:
Bibliographic Details
Main Authors: Mateescu Alexandru
Salomaa Arto
Yu Sheng
Format: Article
Published: 2002
Series:Acta cybernetica 15 No. 3
Kulcsszavak:Számítástechnika, Kibernetika
Subjects:
Online Access:http://acta.bibl.u-szeged.hu/12682
Description
Summary:Representations 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.
Physical Description:339-351
ISSN:0324-721X