Hellis Tamm

Orcid: 0000-0001-5446-3762

According to our database1, Hellis Tamm authored at least 21 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Yet another canonical nondeterministic automaton.
Theor. Comput. Sci., 2024

2023
Duality of lattices associated to left and right quotients.
Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

2022
Quotients and atoms of reversible languages.
Theor. Comput. Sci., 2022

2021
Boolean Automata and Atoms of Regular Languages.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2018
Theoretical Aspects of Symbolic Automata.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017
Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited.
Proceedings of the Language and Automata Theory and Applications, 2017

2016
New Interpretation and Generalization of the Kameda-Weiner Method.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014
Theory of átomata.
Theor. Comput. Sci., 2014

2013
Complexity of atoms of Regular Languages.
Int. J. Found. Comput. Sci., 2013

Minimal Nondeterministic Finite Automata and Atoms of Regular Languages
CoRR, 2013

2012
Quotient Complexities of Atoms of Regular Languages.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Minimal DFA for Symmetric Difference NFA.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

2010
Some Minimality Results on Biresidual and Biseparable Automata.
Proceedings of the Language and Automata Theory and Applications, 2010

2008
On Transition Minimality of Bideterministic Automata.
Int. J. Found. Comput. Sci., 2008

2006
On size reduction techniques for multitape automata.
Theor. Comput. Sci., 2006

2005
Size Reduction of Multitape Automata.
Proceedings of the Implementation and Application of Automata, 2005

2004
Bideterministic automata and minimal representations of regular languages.
Theor. Comput. Sci., 2004

2003
Design and implementation of a string database query language.
Inf. Syst., 2003

2000
Adding String Processing Capabilities to Data Management Systems.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

1999
Implementing a Declarative String Query Language with String Restructuring.
Proceedings of the Practical Aspects of Declarative Languages, 1999


  Loading...