Automatic sequences and formal algebraic series : Alphabets, words, morphisms, finite automata

Alphabets, words, morphisms, finite automata
Automatic sequences and formal algebraic series

Author : Jean-Paul ALLOUCHE

Publication date: October 10, 2005 | Lire en français

Add to my library

2. Alphabets, words, morphisms, finite automata

Definition 3. An alphabet is any finite set $A$ . The elements of $A$ are called letters. A word in $A$ is a finite sequence of symbols belonging to

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!

Ongoing reading
Alphabets, words, morphisms, finite automata

(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...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!

Article included in this offer

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources