Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis. Approximate NFA Universality Motivated by Information Theory. In Yo-Sub Han, György Vaszil, editors, Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings. Volume 13439 of Lecture Notes in Computer Science, pages 142-154, Springer, 2022. [doi]
@inproceedings{KonstantinidisM22,
title = {Approximate NFA Universality Motivated by Information Theory},
author = {Stavros Konstantinidis and Mitja Mastnak and Nelma Moreira and Rogério Reis},
year = {2022},
doi = {10.1007/978-3-031-13257-5_11},
url = {https://doi.org/10.1007/978-3-031-13257-5_11},
researchr = {https://researchr.org/publication/KonstantinidisM22},
cites = {0},
citedby = {0},
pages = {142-154},
booktitle = {Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings},
editor = {Yo-Sub Han and György Vaszil},
volume = {13439},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-031-13257-5},
}