activity
20092015
most citedAbelian Complexity in Minimal Subshifts

67 citations · 109 across the 9 of their papers we have counts for

collaborators

10 papers

cs.CR2015★ 3 cited

Know Your Phish: Novel Techniques for Detecting Phishing Sites and their Targets

Samuel Marchal, Kalle Saari, Nidhi Singh +1

Phishing is a major problem on the Web. Despite the significant attention it has received over the years, there has been no definitive solution. While the state-of-the-art solution…

math.DS2013

Suffix conjugates for a class of morphic subshifts

James D. Currie, Narad Rampersad, Kalle Saari

Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^ω(α), where α is in A. Consider the subshift (X, T), where X is the shift orbit closure…

math.CO2013

Extremal words in morphic subshifts

James D. Currie, Narad Rampersad, Kalle Saari +1

Given an infinite word X over an alphabet A a letter b occurring in X, and a total order σon A, we call the smallest word with respect to σstarting with b in the shift orbit closur…

cs.FL2012

Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences

Daniel Goc, Kalle Saari, Jeffrey Shallit

We investigate questions related to the presence of primitive words and Lyndon words in automatic and linearly recurrent sequences. We show that the Lyndon factorization of a k-aut…

math.CO2012

Lyndon words and Fibonacci numbers

Kalle Saari

It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1…

cs.DM2012

A new geometric approach to Sturmian words

Kaisa Matomäki, Kalle Saari

We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n x n -grid and sets of finite Sturmian words of length n. Using…