Boolean automata and atoms of regular languages
Tamm, Hellis
46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia : proceedings
2021
/
art. 86, p. 86:1–86:13
https://doi.org/10.4230/LIPIcs.MFCS.2021.86
https://www.scopus.com/sourceid/21100244929
https://www.scopus.com/record/display.uri?eid=2-s2.0-85115397554&origin=inward&txGid=18d7867a99cf324a18f21496268985f3
Reordering derivatives of trace closures of regular languages [Online resource]
Maarand, Hendrik
;
Uustalu, Tarmo
30th International Conference on Concurrency Theory : (CONCUR 2019)
2019
/
art. 40 ; 40:1–40:16
https://doi.org/10.4230/LIPIcs.CONCUR.2019.40
https://www.scopus.com/sourceid/21100244929
https://www.scopus.com/record/display.uri?eid=2-s2.0-85071609227&origin=inward&txGid=744304a9fedf8eba5714cdb0ce382fe3