EMBEDDINGS OF LOCAL AUTOMATA

摘要

We prove that any local irreducible 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.