scientific article; zbMATH DE number 2050931
From MaRDI portal
Publication:4453205
zbMath1103.68583MaRDI QIDQ4453205
Publication date: 7 March 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Lifting query complexity to time-space complexity for two-way finite automata ⋮ State complexity of some operations on binary regular languages ⋮ Limitations of lower bound methods for deterministic nested word automata ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ Nondeterministic Complexity of Operations on Closed and Ideal Languages ⋮ Nondeterministic complexity in subclasses of convex languages ⋮ Complement on Free and Ideal Languages ⋮ Deterministic blow-ups of minimal NFA's
This page was built for publication:
