On emptiness and membership problems for set automata
From MaRDI portal
Publication:1625181
DOI10.1007/978-3-319-90530-3_25zbMath1485.68145OpenAlexW2800250850MaRDI QIDQ1625181
Publication date: 28 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-90530-3_25
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
On computational complexity of set automata ⋮ Automata equipped with auxiliary data structures and regular realizability problems
This page was built for publication: On emptiness and membership problems for set automata
