2. Alphabets, words, morphisms, finite automata
Definition 3. An alphabet is any finite set . The elements of are called letters. A word in is a finite sequence of symbols belonging to .
The length of the...
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
Ongoing reading
Alphabets, words, morphisms, finite automata
References
-
(1) - ALLOUCHE (J.-P.), SHALLIT (J.) - Automatic sequences. Theory, Applications, Generalizations - , Cambridge University Press, 571 + xvi pages (2003).
-
(2) - CHRISTOL (G.) - Ensembles presque périodiques k-reconnaissables - , Theoretical Computer Science 9, p. 141-145 (1979).
-
(3)...
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!