On emptiness and membership problems for set automata
From MaRDI portal
Publication:1625181
DOI10.1007/978-3-319-90530-3_25zbMath1485.68145MaRDI QIDQ1625181
Publication date: 28 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-90530-3_25
68Q45: Formal languages and automata
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)