Anzeige
Erschienen in:
2017 | OriginalPaper | Buchkapitel
On Computational Complexity of Set Automata
verfasst von : Alexander A. Rubtsov, Mikhail N. Vyalyi
Erschienen in: Developments in Language Theory
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
We consider a computational model which is known as set automata. The set automata are one-way finite automata with an additional storage—the set. There are two kinds of set automata—the deterministic and the nondeterministic ones. We denote them as DSA and NSA respectively. The model was introduced by M. Kutrib, A. Malcher, M. Wendlandt in 2014 in [3, 4]. It was shown that DSA-languages look similar to DCFL due to their closure properties and NSA-languages look similar to CFL due to their undecidability properties.
In this paper we show that this similarity is natural: we prove that languages recognizable by NSA form a rational cone, so as CFL. The main topic of this paper is computational complexity: we prove that languages recognizable by DSA belong to \({\mathbf {P}}\), and the word membership problem is \({\mathbf {P}}\)-complete for DSA without \(\varepsilon \)-loops; languages recognizable by NSA are in \({\mathbf {NP}}\), and there are \({\mathbf {NP}}\)-complete languages among them. Also we prove that the emptiness problem is \({\mathbf {PSPACE}}\)-hard for DSA.