Concise Representations of Reversible Automata

Abstract : We present two concise representations of reversible automata. Both representations have a size which is comparable with the size of the minimum equivalent deterministic automaton and can be exponentially smaller than the size of the explicit representations of corresponding reversible automata. Using those representations it is possible to simulate the computations of reversible automata without explicitly writing down their complete descriptions.
Type de document :
Communication dans un congrès
Giovanni Pighizzini; Cezar Câmpeanu. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10316, pp.238-249, 2017, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-60252-3_19〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01657009
Contributeur : Hal Ifip <>
Soumis le : mercredi 6 décembre 2017 - 11:44:18
Dernière modification le : mercredi 6 décembre 2017 - 13:46:18

Fichier

 Accès restreint
Fichier visible le : 2020-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Giovanna Lavado, Luca Prigioniero. Concise Representations of Reversible Automata. Giovanni Pighizzini; Cezar Câmpeanu. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10316, pp.238-249, 2017, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-60252-3_19〉. 〈hal-01657009〉

Partager

Métriques

Consultations de la notice

16