scientific article; zbMATH DE number 6415501
From MaRDI portal
Publication:5178455
DOI10.25596/jalc-2012-205zbMath1322.68123MaRDI QIDQ5178455
Publication date: 16 March 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turing machinesstate complexitytwo-way finite automatadescriptional complexityspace complexityminicomplexity
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Unary probabilistic and quantum automata on promise problems ⋮ Two-way non-uniform finite automata ⋮ A Logical Characterization of Small 2NFAs ⋮ Improved complement for two-way alternating automata ⋮ Two-Way Non-Uniform Finite Automata ⋮ Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata ⋮ State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis ⋮ Complement for two-way alternating automata ⋮ Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice ⋮ A Logical Characterization of Small 2NFAs
This page was built for publication:
