• 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 https://www.scopus.com/sourceid/21100244929 https://www.scopus.com/record/display.uri?eid=2-s2.0-85115397554&origin=inward&txGid=18d7867a99cf324a18f21496268985f3
• Complexity of atoms of regular languagesBrzozowski, Janusz; Tamm, HellisInternational Journal of Foundations of Computer Science2013 / p. 1009 - 1027 https://doi.org/10.1142/S0129054113400285 https://www.scopus.com/sourceid/4700152641 https://www.scopus.com/record/display.uri?eid=2-s2.0-84897656838&origin=resultslist&sort=plf-f&src=s&sot=b&sdt=b&s=DOI%2810.1142%2FS0129054113400285%29&sessionSearchId=f5537800810c8e1f4bbc115ea06ecda6 https://jcr.clarivate.com/jcr-jp/journal-profile?journal=INT%20J%20FOUND%20COMPUT%20S&year=2013 https://www.webofscience.com/wos/woscc/full-record/WOS:000332114100006