| Issue |
RAIRO-Theor. Inf. Appl.
Volume 33, Number 2, March April 1999
|
|
|---|---|---|
| Page(s) | 117 - 124 | |
| DOI | https://doi.org/10.1051/ita:1999109 | |
| Published online | 15 August 2002 | |
Undecidability of the equivalence of finite substitutions on regular language
1
Turku Centre for Computer Science TUCS, Lemminkäisenkatu 14 A,
FIN-20520 Turku, Finland; vehalava@cs.utu.fi.
2
Department of Mathematics,
University of Turku,
FIN-20014 Turku, Finland; harju@utu.fi.
Received:
February
1998
Accepted:
December
1998
A simplified proof is given for the following result due to Lisovik: it is undecidable for two given ε–free finite substitutions, whether they are equivalent on the regular language b{0,1}*c.
© EDP Sciences, 1999
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.