Titlebook: Structures in Logic and Computer Science; A Selection of Essay Jan Mycielski,Grzegorz Rozenberg,Arto Salomaa Book 1997 Springer-Verlag Berl

善辩

Nebulous

Meditative

宴会

斥责

Combinatorics of standard Sturmian words,ferent procedures. The first uses the operator of left palindrome closure, whereas the second uses some elementary standard morphisms. We prove the existence of a basic correspondence, that we call standard, between these two methods.

喃喃诉苦

Compactness of systems of equations on completely regular semigroups,mbers have finite matrices is shown to satisfy CP if and only if the corresponding variety of groups satisfies CP. It is then shown that the varieties of bands of groups satisfy the condition on finite matrices.

Dysplasia

0302-9743 raphs and algorithms, pattern matching and learning, combinatorics of words, algebra of languages, formal language theory, and computational molecular biology.978-3-540-63246-7978-3-540-69242-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

Neuropeptides

Ehrenfeucht games, the composition method, and the monadic theory of ordinal words,ich gives “recursive ordinal words”). It is shown that the monadic theory of a recursive ..-word belongs to the 2.-th level of the arithmetical hierarchy, and that in general this bound cannot be improved.

obscurity

HOWL

Expressive power of unary counters,ch builds a term of sort N that counts the number of elements of the finite model satisfying a formula .. Our main result shows that the stronger operator .(.)∶., where . is a term of sort N, cannot be expressed in .. That is, being able to count elements does not allow one to count terms..This pape