On the equivalence of compositions of morphisms and inverse morphisms on regular languages
RAIRO. Inform. théor., 19 3 (1985) 203-211
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):
Machines, Computations, and Universality
Juhani KarhumäkiLecture Notes in Computer Science, Machines, Computations, and Universality 3354 36 (2005)
https://doi.org/10.1007/978-3-540-31834-7_3
Jewels are Forever
Juhani Karhumäki and Leonid P. LisovikJewels are Forever 97 (1999)
https://doi.org/10.1007/978-3-642-60207-8_9
The undecidability of some equivalence problems concerning ngsm's and finite substitutions
P. TurakainenTheoretical Computer Science 174 (1-2) 269 (1997)
https://doi.org/10.1016/S0304-3975(96)00246-0
Multiplicities: A deterministic view of nondeterminism
Juhani KarhumäkiTheoretical Computer Science 98 (1) 15 (1992)
https://doi.org/10.1016/0304-3975(92)90376-Q
New techniques for proving the decidability of equivalence problems
Karel CulikTheoretical Computer Science 71 (1) 29 (1990)
https://doi.org/10.1016/0304-3975(90)90189-O
Cardinality problems of compositions of morphisms and inverse morphisms
T. Harju and H. C. M. KleijnMathematical Systems Theory 22 (1) 151 (1989)
https://doi.org/10.1007/BF02088295
Bifaithful starry transductions
M. Latteux and E. TimmermanInformation Processing Letters 28 (1) 1 (1988)
https://doi.org/10.1016/0020-0190(88)90135-4
Automata, Languages and Programming
Karel CulikLecture Notes in Computer Science, Automata, Languages and Programming 317 162 (1988)
https://doi.org/10.1007/3-540-19488-6_114
On some transducer equivalence problems for families of languages
Paavo TurakainenInternational Journal of Computer Mathematics 23 (2) 99 (1988)
https://doi.org/10.1080/00207168808803611
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
Trends, Techniques, and Problems in Theoretical Computer Science
Juhani KarhumäkiLecture Notes in Computer Science, Trends, Techniques, and Problems in Theoretical Computer Science 281 26 (1987)
https://doi.org/10.1007/3540185356_28
Balance of many-valued transductions and equivalence problems
Yael Maon and Amiram YehudaiTheoretical Computer Science 47 247 (1986)
https://doi.org/10.1016/0304-3975(86)90151-9
Mathematical Foundations of Computer Science 1986
Karel Culik and Juhani KarhumäkiLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1986 233 264 (1986)
https://doi.org/10.1007/BFb0016250
A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language
J. Karhumäki and Y. MaonJournal of Computer and System Sciences 32 (3) 315 (1986)
https://doi.org/10.1016/0022-0000(86)90032-2
The equivalence of finite valued transducers (on HDT0L languages) is decidable
Karel Culik and Juhani KarhumäkiTheoretical Computer Science 47 71 (1986)
https://doi.org/10.1016/0304-3975(86)90134-9
On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages
Yael MaonTheoretical Computer Science 41 105 (1985)
https://doi.org/10.1016/0304-3975(85)90063-5