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):

Weighted automata on infinite words in the context of Attacker–Defender games

V. Halava, T. Harju, R. Niskanen and I. Potapov
Information and Computation 255 27 (2017)
DOI: 10.1016/j.ic.2017.05.001
See this article

Extension of the decidability of the marked PCP to instances with unique blocks

Vesa Halava, Tero Harju, Juhani Karhumäki and Michel Latteux
Theoretical Computer Science 380 (3) 355 (2007)
DOI: 10.1016/j.tcs.2007.03.024
See this article

The exact complexity of the infinite Post Correspondence Problem

Olivier Finkel
Information Processing Letters 115 (6-8) 609 (2015)
DOI: 10.1016/j.ipl.2015.02.009
See this article

THREE APPLICATIONS TO RATIONAL RELATIONS OF THE HIGH UNDECIDABILITY OF THE INFINITE POST CORRESPONDENCE PROBLEM IN A REGULAR ω-LANGUAGE

OLIVIER FINKEL
International Journal of Foundations of Computer Science 23 (07) 1481 (2012)
DOI: 10.1142/S0129054112400606
See this article

Static Analysis

Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, et al.
Lecture Notes in Computer Science, Static Analysis 11822 162 (2019)
DOI: 10.1007/978-3-030-32304-2_9
See this article

SOFSEM 2008: Theory and Practice of Computer Science

Paul Bell and Igor Potapov
Lecture Notes in Computer Science, SOFSEM 2008: Theory and Practice of Computer Science 4910 148 (2008)
DOI: 10.1007/978-3-540-77566-9_13
See this article