On the equality sets for homomorphisms on free monoids with two generators
RAIRO. Inform. théor., 14 4 (1980) 349-369
Published online: 2017-02-01
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):
Unambiguous injective morphisms in free groups
Joel D. Day and Daniel ReidenbachInformation and Computation 289 104946 (2022)
https://doi.org/10.1016/j.ic.2022.104946
Unveiling Dynamics and Complexity
Štěpán Holub and Robert VeroffLecture Notes in Computer Science, Unveiling Dynamics and Complexity 10307 24 (2017)
https://doi.org/10.1007/978-3-319-58741-7_3
Closure properties of pattern languages
Joel D. Day, Daniel Reidenbach and Markus L. SchmidJournal of Computer and System Sciences 84 11 (2017)
https://doi.org/10.1016/j.jcss.2016.07.003
Periodicity forcing words
Joel D. Day, Daniel Reidenbach and Johannes C. SchneiderTheoretical Computer Science 601 2 (2015)
https://doi.org/10.1016/j.tcs.2015.08.033
INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE
ELENA CZEIZLER, ŠTĚPÁN HOLUB, JUHANI KARHUMÄKI and MARKKU LAINEInternational Journal of Foundations of Computer Science 18 (06) 1167 (2007)
https://doi.org/10.1142/S0129054107005212
Binary equality sets are generated by two words
Štěpán HolubJournal of Algebra 259 (1) 1 (2003)
https://doi.org/10.1016/S0021-8693(02)00534-3
Developments in Language Theory
Štěpán HolubLecture Notes in Computer Science, Developments in Language Theory 2450 245 (2003)
https://doi.org/10.1007/3-540-45005-X_21
Handbook of Formal Languages
Christian Choffrut and Juhani KarhumäkiHandbook of Formal Languages 329 (1997)
https://doi.org/10.1007/978-3-642-59136-5_6
STACS 96
T. Harju, J. Karhumäki and D. KrobLecture Notes in Computer Science, STACS 96 1046 37 (1996)
https://doi.org/10.1007/3-540-60922-9_4
Automata, Languages and Programming
Marjo LipponenLecture Notes in Computer Science, Automata, Languages and Programming 944 63 (1995)
https://doi.org/10.1007/3-540-60084-1_63
Publications of K. Culik
RAIRO - Theoretical Informatics and Applications 28 (3-4) 425 (1994)https://doi.org/10.1051/ita/1994283-404251
Deciding whether a finite set of words has rank at most two
Jean NéraudTheoretical Computer Science 112 (2) 311 (1993)
https://doi.org/10.1016/0304-3975(93)90023-M
Representations of language families by homomorphic equality operations and generalized equality sets
Franz-Josef BrandenburgTheoretical Computer Science 55 (2-3) 183 (1987)
https://doi.org/10.1016/0304-3975(87)90103-4
Automata, Languages and Programming
Juhani KarhumäkiLecture Notes in Computer Science, Automata, Languages and Programming 267 136 (1987)
https://doi.org/10.1007/3-540-18088-5_12
The Book of L
K. Culik and J. KarhumäkiThe Book of L 63 (1986)
https://doi.org/10.1007/978-3-642-95486-3_5
Test sets for morphisms with bounded delay
Christian Choffrut and Juhani KarhumäkiDiscrete Applied Mathematics 12 (2) 93 (1985)
https://doi.org/10.1016/0166-218X(85)90063-0
The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoids
Juhani KarhumäkiTheoretical Computer Science 29 (3) 285 (1984)
https://doi.org/10.1016/0304-3975(84)90004-5
On binary equality sets and a solution to the test set conjecture in the binary case
A Ehrenfeucht, J Karhumäki and G RozenbergJournal of Algebra 85 (1) 76 (1983)
https://doi.org/10.1016/0021-8693(83)90119-9
The (generalized) post correspondence problem with lists consisting of two words is decidable
A. Ehrenfeucht, J. Karhumäki and G. RozenbergTheoretical Computer Science 21 (2) 119 (1982)
https://doi.org/10.1016/0304-3975(89)90080-7