Tomi Kärki

According to our database1, Tomi Kärki authored at least 19 papers between 2006 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Minimal Similarity Relations for Square-Free Words.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
Similarity Relations and Repetition-Freeness.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012
Repetition-freeness with Cyclic Relations and Chain Relations.
Fundam. Informaticae, 2012

2011
On the number of frames in binary words.
Theor. Comput. Sci., 2011

A new proof for the decidability of D0L ultimate periodicity
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

The Number of Positions Starting a Square in Binary Words.
Electron. J. Comb., 2011

2010
On the number of squares in partial words.
RAIRO Theor. Informatics Appl., 2010

A New Proof of the Three-Squares Lemma for Partial Words with One Hole.
Int. J. Found. Comput. Sci., 2010

Multidimensional generalized automatic sequences and shape-symmetric morphic words.
Discret. Math., 2010

On the Periodicity of Morphic Words.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Overlap-freeness in infinite partial words.
Theor. Comput. Sci., 2009

The theorem of Fine and Wilf for relational periods.
RAIRO Theor. Informatics Appl., 2009

On the Recognizability of Self-generating Sets.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008
Compatibility relations on codes and free monoids.
RAIRO Theor. Informatics Appl., 2008

Square-free partial words.
Inf. Process. Lett., 2008

Interaction Properties of Relational Periods.
Discret. Math. Theor. Comput. Sci., 2008

Relationally Periodic Sequences and Subword Complexity.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
Relational codes of words.
Theor. Comput. Sci., 2007

2006
Transcendence of numbers with an expansion in a subclass of complexity 2n+1.
RAIRO Theor. Informatics Appl., 2006


  Loading...