default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomi Kärki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c6]Tero Harju, Tomi Kärki:
Minimal Similarity Relations for Square-Free Words. Discrete Mathematics and Computer Science 2014: 193-200- 2013
- [c5]Tomi Kärki:
Similarity Relations and Repetition-Freeness. WORDS 2013: 169-180 - 2012
- [j13]Tomi Kärki:
Repetition-freeness with Cyclic Relations and Chain Relations. Fundam. Informaticae 116(1-4): 157-174 (2012) - 2011
- [j12]Tero Harju
, Tomi Kärki, Dirk Nowotka:
The Number of Positions Starting a Square in Binary Words. Electron. J. Comb. 18(1) (2011) - [j11]Tero Harju, Tomi Kärki:
On the number of frames in binary words. Theor. Comput. Sci. 412(39): 5276-5284 (2011) - [c4]Vesa Halava, Tero Harju, Tomi Kärki:
A new proof for the decidability of D0L ultimate periodicity. WORDS 2011: 147-151 - 2010
- [j10]Emilie Charlier, Tomi Kärki, Michel Rigo:
Multidimensional generalized automatic sequences and shape-symmetric morphic words. Discret. Math. 310(6-7): 1238-1252 (2010) - [j9]Tomi Kärki:
A New Proof of the Three-Squares Lemma for Partial Words with One Hole. Int. J. Found. Comput. Sci. 21(6): 1065-1071 (2010) - [j8]Vesa Halava, Tero Harju, Tomi Kärki:
On the number of squares in partial words. RAIRO Theor. Informatics Appl. 44(1): 125-138 (2010) - [c3]Vesa Halava, Tero Harju, Tomi Kärki, Michel Rigo:
On the Periodicity of Morphic Words. Developments in Language Theory 2010: 209-217
2000 – 2009
- 2009
- [j7]Vesa Halava, Tero Harju, Tomi Kärki:
The theorem of Fine and Wilf for relational periods. RAIRO Theor. Informatics Appl. 43(2): 209-220 (2009) - [j6]Vesa Halava, Tero Harju, Tomi Kärki, Patrice Séébold:
Overlap-freeness in infinite partial words. Theor. Comput. Sci. 410(8-10): 943-948 (2009) - [c2]Tomi Kärki, Anne Lacroix, Michel Rigo:
On the Recognizability of Self-generating Sets. MFCS 2009: 525-536 - [i1]Emilie Charlier, Tomi Kärki, Michel Rigo:
Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words. CoRR abs/0907.0615 (2009) - 2008
- [j5]Tomi Kärki, Tero Harju, Vesa Halava:
Interaction Properties of Relational Periods. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - [j4]Vesa Halava, Tero Harju, Tomi Kärki:
Square-free partial words. Inf. Process. Lett. 108(5): 290-292 (2008) - [j3]Tomi Kärki:
Compatibility relations on codes and free monoids. RAIRO Theor. Informatics Appl. 42(3): 539-552 (2008) - [c1]Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni:
Relationally Periodic Sequences and Subword Complexity. Developments in Language Theory 2008: 196-205 - 2007
- [j2]Vesa Halava, Tero Harju, Tomi Kärki:
Relational codes of words. Theor. Comput. Sci. 389(1-2): 237-249 (2007) - 2006
- [j1]Tomi Kärki:
Transcendence of numbers with an expansion in a subclass of complexity 2n+1. RAIRO Theor. Informatics Appl. 40(3): 459-471 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
