Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited

The problem DFA-Intersection-Nonemptiness asks if a given number of deterministic automata accept a common word. In general, this problem is PSPACE-complete. Here, we investigate this problem for the subclasses of commutative automata and automata recognizing sparse languages. We show that in both c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Fernau, Henning, Hoffmann, Stefan, Wehar, Michael
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Databases Computer Science - Formal Languages and Automata Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!