Decimations of languages and state complexity

Theor. Comput. Sci., pp. 2401-2409, 2009.

Cited by: 19|Bibtex|Views1|Links
EI
Keywords:
state complexityDeterministic finite automatonradix orderlanguage LSlender languageMore(8+)

Abstract:

Let the words of a language L be arranged in increasing radix order: L={w"0,w"1,w"2,...}. We consider transformations that extract terms from L in an arithmetic progression. For example, two such transformations are even(L)={w"0,w"2,w"4...} and odd(L)={w"1,w"3,w"5,...}. Lecomte and Rigo observed that if L is regular, then so are even(L), ...More

Code:

Data:

Your rating :
0

 

Tags
Comments