- Tomoyuki Yamakami:
Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice. LATA 2019: 134-145 - Vladimir A. Zakharov:
Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automata. LATA 2019: 146-158 - Ilya Zakirzyanov, António Morgado
, Alexey Ignatiev, Vladimir Ulyantsev, João Marques-Silva:
Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference. LATA 2019: 159-173 - Ahad N. Zehmakan:
Tight Bounds on the Minimum Size of a Dynamic Monopoly. LATA 2019: 381-393 - Carlos Martín-Vide, Alexander Okhotin, Dana Shapira:
Language and Automata Theory and Applications - 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings. Lecture Notes in Computer Science 11417, Springer 2019, ISBN 978-3-030-13434-1 [contents]
