Descriptional and Computational Complexity of the Circuit Representation of Finite Automata
Crossref DOI link: https://doi.org/10.1007/978-3-319-77313-1_8
Published Online: 2018-03-08
Published Print: 2018
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Valdats, Māris
License valid from 2018-01-01