Embeddings of automata
Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin · HAL (Le Centre pour la Communication Scientifique Directe) · 2007
We prove that any local automaton is contained in a complete one. The proof uses Nasu's masking lemma. We use the same technique to give a new proof that any weakly deterministic irreducible automaton is contained in a complete one.