On the Complexity of Flanked Finite State Automata - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2015

On the Complexity of Flanked Finite State Automata

Résultat de complexité pour les automates flanqués

Résumé

We define a new subclass of nondeterministic finite automata for prefix-closed languages called Flanked Finite Automata (FFA). We show that this class enjoys good complexity properties while preserving the succinctness of nondeterministic automata. In particular, we show that the universality problem for FFA is in linear time and that language inclusion can be checked in polynomial time. A useful application of FFA is to provide an efficient way to compute the quotient and inclusion of regular languages without the need to use the powerset construction. These operations are the building blocks of several verification algorithms.
Fichier principal
Vignette du fichier
ffa.pdf (217.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01202702 , version 1 (21-09-2015)
hal-01202702 , version 2 (07-03-2017)

Identifiants

Citer

Florent Avellaneda, Silvano Dal Zilio, Jean-Baptiste Raclet. On the Complexity of Flanked Finite State Automata. 2015. ⟨hal-01202702v1⟩
606 Consultations
747 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More