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

CESS

Palindromes in Sturmian Words,We 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.

恭维

为现场

农学

全神贯注于

Sonja Novković,Cian McMahon,Karen Miner possible restrictions on the permitted moves between pegs. We prove that all these Hanoi puzzles give rise to infinite morphic sequences of moves, whose appropriate truncations describe the transfer of any given number of disks. Furthermore two of these infinite sequences are actually automatic sequences.

Canvas

Jeffrey Bardzell,Shaowen Bardzellword .∈Σ. (depending on .). We overview some recent results related to this notion. One of these results implies that the property of being .-collapsing is algorithmically recognizable for any given positive integer ..

Range-Of-Motion

extrovert

Bridle

Well-being Marketing as Humanistic Marketing a rational subset of the finitely generated semigroup . with . as the set of generators and language concatenation as a product. We prove that for any rational set . and any regular language . ⊆ Σ. it is decidable (1) whether . or not, and (2) whether . is finite or not.

树胶