Maris Valdats. Descriptional and Computational Complexity of the Circuit Representation of Finite Automata. In Shmuel Tomi Klein, Carlos Martín-Vide, Dana Shapira, editors, Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings. Volume 10792 of Lecture Notes in Computer Science, pages 105-117, Springer, 2018. [doi]
@inproceedings{Valdats18,
title = {Descriptional and Computational Complexity of the Circuit Representation of Finite Automata},
author = {Maris Valdats},
year = {2018},
doi = {10.1007/978-3-319-77313-1_8},
url = {https://doi.org/10.1007/978-3-319-77313-1_8},
researchr = {https://researchr.org/publication/Valdats18},
cites = {0},
citedby = {0},
pages = {105-117},
booktitle = {Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings},
editor = {Shmuel Tomi Klein and Carlos Martín-Vide and Dana Shapira},
volume = {10792},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-77313-1},
}