Computational limitations of affine automata

DOI10.1007/978-3-030-19311-9_10OpenAlexW2964216445MaRDI QIDQ2326807

Etienne Moutot, Mika Hirvensalo, Abuzer Yakaryılmaz

Publication date: 10 October 2019

Full work available at URL: https://arxiv.org/abs/1904.02428

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (4)

Affine automata verifiers ⋮ Computational limitations of affine automata and generalized affine automata ⋮ Error-Free Affine, Unitary, and Probabilistic OBDDs ⋮ Improved constructions for succinct affine automata

This page was built for publication: Computational limitations of affine automata