Embeddings of automata
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...