DLT
2008
14 years 1 months ago
2008
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the...
DLT
2008
14 years 1 months ago
2008
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
DLT
2008
14 years 1 months ago
2008
The classes of languages which are boolean combinations of languages of the form A a1A a2A . . . A a A , where a1, . . . , a A, k , for a fixed k 0, form a natural hierarchy wit...
DLT
2008
14 years 1 months ago
2008
DLT
2008
14 years 1 months ago
2008
DLT
2008
14 years 1 months ago
2008
DLT
2008
14 years 1 months ago
2008
DLT
2008
14 years 1 months ago
2008
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
DLT
2008
14 years 1 months ago
2008
DLT
2007
14 years 1 months ago
2007
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...