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

Complexity of atoms of regular languagesBrzozowski, Janusz; Tamm, HellisInternational Journal of Foundations of Computer Science2013 / p. 1009 - 1027 https://doi.org/10.1142/S0129054113400285 Journal metrics at Scopus Article at Scopus Journal metrics at WOS Article at WOS

Yet another canonical nondeterministic automatonMaarand, Hendrik; Tamm, HellisDescriptional Complexity of Formal Systems : 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, proceedings2022 / p. 184-196 : ill https://doi.org/10.1007/978-3-031-13257-5_14 Conference Proceedings at Scopus Article at Scopus Conference Proceedings at WOS Article at WOS

Yet another canonical nondeterministic automatonMaarand, Hendrik; Tamm, HellisTheoretical computer science2024 / art. 114581, 15 p. : ill https://doi.org/10.1016/j.tcs.2024.114581 Journal metrics at Scopus Article at Scopus Journal metrics at WOS Article at WOS