Skip to Main content Skip to Navigation
Reports

Embeddings of automata

Abstract : 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.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00627816
Contributor : Sylvain Lombardy <>
Submitted on : Thursday, September 29, 2011 - 4:12:26 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:06 PM
Long-term archiving on: : Friday, December 30, 2011 - 2:30:17 AM

File

HAL.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00627816, version 1

Collections

Citation

Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin. Embeddings of automata. 2007. ⟨hal-00627816⟩

Share

Metrics

Record views

305

Files downloads

75