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:

Undecidability of the equivalence of finite substitutions on regular language

Vesa Halava, Tero Harju

RAIRO-Theor. Inf. Appl., 33 2 (1999) 117-124

Published online: 2002-08-15

DOI: https://doi.org/10.1051/ita:1999109

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

Fundamentals of Computation Theory

Michal Kunc
Lecture Notes in Computer Science, Fundamentals of Computation Theory 4639 365 (2007)
https://doi.org/10.1007/978-3-540-74240-1_32

Machines, Computations, and Universality

Juhani Karhumäki
Lecture Notes in Computer Science, Machines, Computations, and Universality 3354 36 (2005)
https://doi.org/10.1007/978-3-540-31834-7_3

The Equivalence Problem of Finite Substitutions on ab*c, with Applications

J. Karhumäki and L. P. Lisovik
International Journal of Foundations of Computer Science 14 (04) 699 (2003)
https://doi.org/10.1142/S0129054103001960

A simple undecidable problem: the inclusion problem for finite substitutions on ab*c

J. Karhumäki and L.P. Lisovik
Information and Computation 187 (1) 40 (2003)
https://doi.org/10.1016/S0890-5401(03)00120-2

Automata, Languages and Programming

J. Karhumäki and L. P. Lisovik
Lecture Notes in Computer Science, Automata, Languages and Programming 2380 812 (2002)
https://doi.org/10.1007/3-540-45465-9_69

Machines, Computations, and Universality

Juhani Karhumäki
Lecture Notes in Computer Science, Machines, Computations, and Universality 2055 69 (2001)
https://doi.org/10.1007/3-540-45132-3_4