scientific article; zbMATH DE number 2068869
From MaRDI portal
Publication:4465328
zbMath1095.68603MaRDI QIDQ4465328
Publication date: 27 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes ⋮ On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ More on deterministic and nondeterministic finite cover automata
This page was built for publication:
