22 search results - page 1 / 5 » Prime Decompositions of Regular Languages |
DLT
2006
14 years 9 days ago
2006
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 the language yields a...
FUIN
2007
13 years 11 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
COCOON
2006
Springer
14 years 2 months ago
2006
Springer
We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of...
COMBINATORICS
2006
13 years 11 months ago
2006
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
JUCS
2002
13 years 10 months ago
2002
