Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

Deciding whether a finite set of words has rank at most two

Jean Néraud
Theoretical Computer Science 112 (2) 311 (1993)
DOI: 10.1016/0304-3975(93)90023-M
See this article

Test sets for morphisms with bounded delay

Christian Choffrut and Juhani Karhumäki
Discrete Applied Mathematics 12 (2) 93 (1985)
DOI: 10.1016/0166-218X(85)90063-0
See this article

Closure properties of pattern languages

Joel D. Day, Daniel Reidenbach and Markus L. Schmid
Journal of Computer and System Sciences 84 11 (2017)
DOI: 10.1016/j.jcss.2016.07.003
See this article

INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE

ELENA CZEIZLER, ŠTĚPÁN HOLUB, JUHANI KARHUMÄKI and MARKKU LAINE
International Journal of Foundations of Computer Science 18 (06) 1167 (2007)
DOI: 10.1142/S0129054107005212
See this article

Binary equality sets are generated by two words

Štěpán Holub
Journal of Algebra 259 (1) 1 (2003)
DOI: 10.1016/S0021-8693(02)00534-3
See this article

Periodicity forcing words

Joel D. Day, Daniel Reidenbach and Johannes C. Schneider
Theoretical Computer Science 601 2 (2015)
DOI: 10.1016/j.tcs.2015.08.033
See this article

On binary equality sets and a solution to the test set conjecture in the binary case

A Ehrenfeucht, J Karhumäki and G Rozenberg
Journal of Algebra 85 (1) 76 (1983)
DOI: 10.1016/0021-8693(83)90119-9
See this article

Representations of language families by homomorphic equality operations and generalized equality sets

Franz-Josef Brandenburg
Theoretical Computer Science 55 (2-3) 183 (1987)
DOI: 10.1016/0304-3975(87)90103-4
See this article

Unveiling Dynamics and Complexity

Štěpán Holub and Robert Veroff
Lecture Notes in Computer Science, Unveiling Dynamics and Complexity 10307 24 (2017)
DOI: 10.1007/978-3-319-58741-7_3
See this article

The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoids

Juhani Karhumäki
Theoretical Computer Science 29 (3) 285 (1984)
DOI: 10.1016/0304-3975(84)90004-5
See this article

T. Harju, J. Karhumäki and D. Krob
1046 37 (1996)
DOI: 10.1007/3-540-60922-9_4
See this article

Christian Choffrut and Juhani Karhumäki
329 (1997)
DOI: 10.1007/978-3-642-59136-5_6
See this article

Juhani Karhumäki
267 136 (1987)
DOI: 10.1007/3-540-18088-5_12
See this article

K. Culik and J. Karhumäki
63 (1986)
DOI: 10.1007/978-3-642-95486-3_5
See this article

Štěpán Holub
2450 245 (2003)
DOI: 10.1007/3-540-45005-X_21
See this article

The (generalized) post correspondence problem with lists consisting of two words is decidable

A. Ehrenfeucht, J. Karhumäki and G. Rozenberg
Theoretical Computer Science 21 (2) 119 (1982)
DOI: 10.1016/0304-3975(89)90080-7
See this article

Publications of K. Culik

RAIRO - Theoretical Informatics and Applications 28 (3-4) 425 (1994)
DOI: 10.1051/ita/1994283-404251
See this article