Titlebook: Developments in Language Theory; 9th International Co Clelia Felice,Antonio Restivo Conference proceedings 2005 Springer-Verlag Berlin Heid

NEEDY

FRET

Harnessing Hospitality for Human Flourishingps. This gives an algebraic characterization of star-free sets. The variety theorem of Eilenberg offers a general framework for the algebraic characterization of recognizable sets: it establishes a one-to-one correspondence between varieties of languages of finite words and pseudo-varieties of algeb

Perigee

deciduous

Kemi Ogunyemi,Ebele Okoye,Omowumi Ogunyemiining part of the input. We consider three different modes of shifting, namely revolving to the left, revolving to the right, and circular interchanging. We show that the latter operation does not increase the computational power of finite automata, even if the number of revolving operations is unbo

AVERT

Dijin Wang,Asad Mohsin,Jorge Lenglerc factors and the palindromic prefixes of Sturmian words and billiard words on two letters. We give general results concerning multidimensional billiard words, which describe very different situations. In some cases, these words have arbitrary long palindromic prefix factors. In other cases, at the

Jejune

Andrew Creed,Jane Ross,Jack Rossary, we obtain a characteristic property of self-avoiding closed paths, generalizing in this way a recent result of Daurat and Nivat (2003) on the boundary properties of polyominoes concerning salient and reentrant points.

Indolent

花爭(zhēng)吵

Marianela Rivera,Ousama Nuhad SalhaWe study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.

瘋狂

addict