Descriptional and computational complexity of the circuit representation of finite automata

DOI10.1007/978-3-319-77313-1_8zbMath1504.68119OpenAlexW2793976475MaRDI QIDQ1647686

Māris Valdats

Publication date: 26 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-77313-1_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

This page was built for publication: Descriptional and computational complexity of the circuit representation of finite automata