Boolean automata and atoms of regular languagesTamm, Hellis46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia : proceedings2021 / art. 86, p. 86:1–86:13 https://doi.org/10.4230/LIPIcs.MFCS.2021.86 Conference Proceedings at Scopus Article at Scopus

Reordering derivatives of trace closures of regular languages [Online resource]Maarand, Hendrik; Uustalu, Tarmo30th International Conference on Concurrency Theory : (CONCUR 2019)2019 / art. 40 ; 40:1–40:16 https://doi.org/10.4230/LIPIcs.CONCUR.2019.40 Conference proceeding at Scopus Article at Scopus