Algorithms Based on Finite Automata for Testing of Z-codes

Abstract : In this paper, we propose an algorithm to decide whether a regular language recognized by finite automata is a Z-code or not. This algorithm has time complexity O(n4) for the general case of non-deterministic automata, O(n2) for the restricted case of deterministic automata, where n is the number of states of finite automata.
Type de document :
Communication dans un congrès
James J. Park; Albert Zomaya; Sang-Soo Yeo; Sartaj Sahni. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. Springer, Lecture Notes in Computer Science, LNCS-7513, pp.625-635, 2012, Network and Parallel Computing. 〈10.1007/978-3-642-35606-3_74〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01551321
Contributeur : Hal Ifip <>
Soumis le : vendredi 30 juin 2017 - 10:35:39
Dernière modification le : vendredi 1 décembre 2017 - 01:10:01

Fichier

978-3-642-35606-3_74_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Dang Thang, Nguyen Han, Phan Huy. Algorithms Based on Finite Automata for Testing of Z-codes. James J. Park; Albert Zomaya; Sang-Soo Yeo; Sartaj Sahni. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. Springer, Lecture Notes in Computer Science, LNCS-7513, pp.625-635, 2012, Network and Parallel Computing. 〈10.1007/978-3-642-35606-3_74〉. 〈hal-01551321〉

Partager

Métriques

Consultations de la notice

31

Téléchargements de fichiers

10