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 infinite post correspondence problem for instances of Size 9

Vesa Halava, Tero Harju

RAIRO-Theor. Inf. Appl., 40 4 (2006) 551-557

Published online: 2006-11-08

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

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

Porous invariants for linear systems

Engel Lefaucheux, Joël Ouaknine, David Purser and James Worrell
Formal Methods in System Design 63 (1-3) 235 (2024)
https://doi.org/10.1007/s10703-024-00444-3

Computer Aided Verification

Engel Lefaucheux, Joël Ouaknine, David Purser and James Worrell
Lecture Notes in Computer Science, Computer Aided Verification 12760 172 (2021)
https://doi.org/10.1007/978-3-030-81688-9_8

Developments in Language Theory

Vesa Halava, Tero Harju, Reino Niskanen and Igor Potapov
Lecture Notes in Computer Science, Developments in Language Theory 12811 167 (2021)
https://doi.org/10.1007/978-3-030-81508-0_14

Static Analysis

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

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)
https://doi.org/10.1016/j.ic.2017.05.001

The exact complexity of the infinite Post Correspondence Problem

Olivier Finkel
Information Processing Letters 115 (6-8) 609 (2015)
https://doi.org/10.1016/j.ipl.2015.02.009

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)
https://doi.org/10.1142/S0129054112400606

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)
https://doi.org/10.1007/978-3-540-77566-9_13

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)
https://doi.org/10.1016/j.tcs.2007.03.024