scientific article
From MaRDI portal
Publication:3455037
zbMath1333.68166MaRDI QIDQ3455037
Viliam Geffert, Abuzer Yakaryılmaz
Publication date: 3 December 2015
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2717/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
probabilistic automatadescriptional complexitypromise problemsalternating automatanondeterministic automata
Related Items (9)
Unary probabilistic and quantum automata on promise problems ⋮ Language recognition power and succinctness of affine automata ⋮ Exact Affine Counter Automata ⋮ Tight hierarchy of data-independent multi-head automata ⋮ Minimal Size of Counters for (Real-Time) Multicounter Automata ⋮ Two double-exponential gaps for automata with a limited pushdown ⋮ Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice ⋮ Language Recognition Power and Succinctness of Affine Automata ⋮ Improved constructions for succinct affine automata
This page was built for publication:
