Abstract
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.
Citation
Marie-Pierre Béal. Sylvain Lombardy. Dominique Perrin. "Embeddings of local automata." Illinois J. Math. 54 (1) 155 - 174, Spring 2010. https://doi.org/10.1215/ijm/1299679743
Information
