• 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
• Duality of lattices associated to left and right quotientsBell, Jason; Smertnig, Daniel; Tamm, Hellis16th International Conference on Automata and Formal Languages, AFL 2023, Eger, 5 September - 7 September 20232023 / p. 35-50 https://doi.org/10.4204/EPTCS.386.5 https://www.scopus.com/sourceid/21100244944 https://www.scopus.com/record/display.uri?eid=2-s2.0-85173566435&origin=inward&txGid=0e1a43c690f8c48ae3cf254ccb52af17 https://www.webofscience.com/wos/woscc/full-record/WOS:001160672800001
• Generalization of the double-reversal method of finding a canonical residual finite state automatonTamm, HellisDescriptional Complexity of Formal Systems 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings2015 / p. 268 - 279 https://doi.org/10.1007/978-3-319-19225-3_23 https://www.scopus.com/sourceid/25674 https://www.scopus.com/record/display.uri?eid=2-s2.0-84949008979&origin=inward&txGid=d494d69cf7fafb5fa63fd0829d79998a
• Lower bound methods for the size of nondeterministic finite automata revisitedTamm, Hellis; Merwe, Brink van derLanguage and Automata Theory and Applications : 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017 : proceedings2017 / p. 261-272 https://doi.org/10.1007/978-3-319-53733-7_19 https://www.scopus.com/sourceid/25674 https://www.scopus.com/record/display.uri?eid=2-s2.0-85013378430&origin=inward&txGid=c9b1cd3b5d0721e966934ff666e0f8a2 https://www.webofscience.com/wos/woscc/full-record/WOS:000418579700019
• New interpretation and generalization of the Kameda-Weiner methodTamm, Hellis43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)2016 / p. 116:1-116:12 http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.116 https://www.scopus.com/sourceid/21100244929 https://www.scopus.com/record/display.uri?eid=2-s2.0-85012877964&origin=inward&txGid=fb9cb85deb3dc84b124803afa96605f0
• Quotients and atoms of reversible languagesTamm, HellisTheoretical Computer Science2022 / p. 33-45 https://doi.org/10.1016/j.tcs.2022.02.023 https://www.scopus.com/sourceid/20571 https://www.scopus.com/record/display.uri?eid=2-s2.0-85125740252&origin=inward&txGid=8f348c5516ec713375880cc196a8c98a https://jcr.clarivate.com/jcr-jp/journal-profile?journal=THEOR%20COMPUT%20SCI&year=2022 https://www.webofscience.com/wos/woscc/full-record/WOS:000830247200004
• Quotients and atoms of reversible languagesTamm, HellisFormal Methods : FM 2019 International Workshops, Porto, Portugal, October 7-11, 2019, Revised Selected Papers, Part II2020 / p. 443-455 https://doi.org/10.1007/978-3-030-54997-8_28 https://www.scopus.com/sourceid/25674 https://www.scopus.com/record/display.uri?eid=2-s2.0-85089715772&origin=inward&txGid=fec30d6a2b0cd2efd40d2a110267e002
• Theoretical aspects of symbolic automataTamm, Hellis; Veanes, MargusSOFSEM 2018 : Theory and Practice of Computer Science : 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018 : proceedings2018 / p. 428-441 https://doi.org/10.1007/978-3-319-73117-9_30 https://www.scopus.com/sourceid/25674 https://www.scopus.com/record/display.uri?eid=2-s2.0-85041831906&origin=inward&txGid=ef5444c0489d38aa170b12da3394860c https://jcr.clarivate.com/jcr-jp/journal-profile?journal=LECT%20NOTES%20ARTIF%20INT&year=2005 https://www.webofscience.com/wos/woscc/full-record/WOS:000542576400030
• Theory of átomataBrzozowski, Janusz; Tamm, HellisTheoretical computer science2014 / p. 13-27 : ill https://doi.org/10.1016/j.tcs.2014.04.016 https://www.scopus.com/sourceid/20571 https://www.scopus.com/record/display.uri?eid=2-s2.0-84926689142&origin=inward&txGid=bf428d200d54b0c2ba0cb204a9b3c395 https://jcr.clarivate.com/jcr-jp/journal-profile?journal=THEOR%20COMPUT%20SCI&year=2014 https://www.webofscience.com/wos/woscc/full-record/WOS:000338598500002
• Yet another canonical nondeterministic automatonMaarand, Hendrik; Tamm, HellisTheoretical computer science2024 / art. 114581, 15 p. : ill https://doi.org/10.1016/j.tcs.2024.114581 https://www.scopus.com/sourceid/20571 https://www.scopus.com/record/display.uri?eid=2-s2.0-85190994305&origin=resultslist&sort=plf-f&src=s&sot=b&sdt=b&s=TITLE-ABS-KEY%28%22Yet+another+canonical+nondeterministic+automaton%22%29&relpos=0 https://jcr.clarivate.com/jcr-jp/journal-profile?journal=THEOR%20COMPUT%20SCI&year=2023 https://www.webofscience.com/wos/woscc/full-record/WOS:001233630800001
• 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 https://www.scopus.com/sourceid/25674 https://www.scopus.com/record/display.uri?eid=2-s2.0-85137043087&origin=inward&txGid=577efbc4afe5a385a7393f1f49c090a0 https://jcr.clarivate.com/jcr-jp/journal-profile?journal=LECT%20NOTES%20ARTIF%20INT&year=2005 https://www.webofscience.com/wos/woscc/full-record/WOS:000877345300016