A Characterisation of NL/poly via Nondeterministic Finite Automata
From MaRDI portal
Publication:2843096
DOI10.1007/978-3-642-39310-5_19zbMath1388.68077OpenAlexW137890744MaRDI QIDQ2843096
Henning Urbat, Robert S. R. Myers
Publication date: 9 August 2013
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39310-5_19
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
This page was built for publication: A Characterisation of NL/poly via Nondeterministic Finite Automata