Cargando…

Operations on Permutation Automata

We investigate the class of languages recognized by permutation deterministic finite automata. Using automata constructions and some properties of permutation automata, we show that this class is closed under Boolean operations, reversal, and quotients, and it is not closed under concatenation, powe...

Descripción completa

Detalles Bibliográficos
Autores principales: Hospodár, Michal, Mlynárčik, Peter
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7247878/
http://dx.doi.org/10.1007/978-3-030-48516-0_10