On the existence of prime decompositions
We investigate factorizations of regular languages in terms of prime languages. A language
is said to be strongly prime decomposable if any way of factorizing it yields a prime …
is said to be strongly prime decomposable if any way of factorizing it yields a prime …
On Fatou properties of rational languages
C Choffrut, J Karhumäki - … Computer Science, Linguistics and Biology Meet …, 2001 - Springer
We consider so-called Fatou-type properties of rational languages and relations. For
example, if the rational expression E (X 1,..., X n) over arbitrary languages X 1,..., X n …
example, if the rational expression E (X 1,..., X n) over arbitrary languages X 1,..., X n …
[HTML][HTML] A non-ambiguous decomposition of regular languages and factorizing codes
M Anselmo - Discrete applied mathematics, 2003 - Elsevier
Given languages Z, L⊆ Σ∗, Z is L-decomposable (finitely L-decomposable, resp.) if there
exists a non-trivial pair of languages (finite languages, resp.)(A, B), such that Z= AL+ B and …
exists a non-trivial pair of languages (finite languages, resp.)(A, B), such that Z= AL+ B and …
A non-ambiguous language factorization problem
M Anselmo - … In Language Theory: Foundations, Applications, and …, 2000 - World Scientific
Abstract Given languages Z, L⊆ Σ*, we say that Z is L-decomposable (resp., finitely L-
decomposable) if there exists a non-trivial couple (A, B) of languages (resp., finite …
decomposable) if there exists a non-trivial couple (A, B) of languages (resp., finite …
On some factorization problems
We consider three notions of factorization arising in different frameworks: factorizing
languages, factorization of the natural numbers, factorizing codes. A language X⊆ A∗ is …
languages, factorization of the natural numbers, factorizing codes. A language X⊆ A∗ is …