Algorithms Based on Finite Automata for Testing of Z-codes
Résumé
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.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...
