Self-Verifying Finite Automata and Descriptional Complexity

Abstract : We survey recent results on the descriptional complexity of self-verifying finite automata. In particular, we discuss the cost of simulation of self-verifying finite automata by deterministic finite automata, and the complexity of basic regular operations on languages represented by self-verifying finite automata.
Type de document :
Communication dans un congrès
Cezar Câmpeanu; Florin Manea; Jeffrey Shallit. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9777, pp.29-44, 2016, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-41114-9_3〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01633958
Contributeur : Hal Ifip <>
Soumis le : lundi 13 novembre 2017 - 15:33:00
Dernière modification le : lundi 13 novembre 2017 - 15:35:32
Document(s) archivé(s) le : mercredi 14 février 2018 - 15:10:28

Fichier

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

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

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Galina Jirásková. Self-Verifying Finite Automata and Descriptional Complexity. Cezar Câmpeanu; Florin Manea; Jeffrey Shallit. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9777, pp.29-44, 2016, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-41114-9_3〉. 〈hal-01633958〉

Partager

Métriques

Consultations de la notice

42