Zobrazeno 1 - 10
of 347
pro vyhledávání: '"Karhumäki, Juhani"'
Publikováno v:
In Discrete Mathematics September 2024 347(9)
Two finite words $u$ and $v$ are called abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of an infinite word $\mathbf{x}$ is the set of infinite words $\mathbf{y}$ such tha
Externí odkaz:
http://arxiv.org/abs/2012.14701
Two words $u$ and $v$ are $k$-abelian equivalent if, for each word $x$ of length at most $k$, $x$ occurs equally many times as a factor in both $u$ and $v$. The notion of $k$-abelian equivalence is an intermediate notion between the abelian equivalen
Externí odkaz:
http://arxiv.org/abs/1605.03319
Autor:
Freydenberger, Dominik D., Gawrychowski, Pawel, Karhumäki, Juhani, Manea, Florin, Rytter, Wojciech
Publikováno v:
"Multidisciplinary Creativity: homage to Gheorghe Paun on his 65th birthday", Pg. 239--248, Ed. Spandugino, Bucharest, Romania, ISBN: 978-606-8401-63-8, 2015
Two words $w_1$ and $w_2$ are said to be $k$-binomial equivalent if every non-empty word $x$ of length at most $k$ over the alphabet of $w_1$ and $w_2$ appears as a scattered factor of $w_1$ exactly as many times as it appears as a scattered factor o
Externí odkaz:
http://arxiv.org/abs/1509.00622
Autor:
Karhumäki, Juhani, Saarela, Aleksi
Publikováno v:
Proc. Steklov Inst. Math., 274:116-123 (2011)
We consider systems of word equations and their solution sets. We discuss some fascinating properties of those, namely the size of a maximal independent set of word equations, and proper chains of solution sets of those. We recall the basic results,
Externí odkaz:
http://arxiv.org/abs/1506.02913
In this paper we investigate local to global phenomena for a new family of complexity functions of infinite words indexed by $k \in \Ni \cup \{+\infty\}$ where $\Ni$ denotes the set of positive integers. Two finite words $u$ and $v$ in $A^*$ are said
Externí odkaz:
http://arxiv.org/abs/1302.3783
Autor:
Huova, Mari, Karhumäki, Juhani
We introduce new avoidability problems for words by considering equivalence relations, k-abelian equivalences, which lie properly in between equality and commutative equality, i.e. abelian equality. For two k-abelian equivalent words the numbers of o
Externí odkaz:
http://arxiv.org/abs/1104.4273
Publikováno v:
In Information and Computation June 2018 260:89-98