Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-06T00:20:50.376Z Has data issue: false hasContentIssue false
  • English
  • Français

Undecidability of the equivalenceof finite substitutions on regular language

Published online by Cambridge University Press:  15 August 2002

Vesa Halava  and
Tero Harju
Vesa Halava
Affiliation:
Turku Centre for Computer Science TUCS, Lemminkäisenkatu 14 A, FIN-20520 Turku, Finland; vehalava@cs.utu.fi.
Tero Harju
Affiliation:
Department of Mathematics, University of Turku, FIN-20014 Turku, Finland; harju@utu.fi.
Get access

Abstract

A simplified proof is given for the following result due to Lisovik: it is undecidable for two given ε–free finitesubstitutions, whether they are equivalent on the regular languageb{0,1}* c.

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 33 , Issue 2 , March 1999 , pp. 117 - 124
Copyright
© EDP Sciences, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

V. Halava and T. Harju, Undecidability in integer weighted finite automata. Fund. Inform., to appear.
Karhumäki, J., Equations over finite sets of words and equivalence problems in automata theory. Theoret. Comput. Sci. 108 (1993) 103-118. CrossRef
Lisovik, L.P., An undecidable problem for countable Markov chains. Cybernetics 27 (1991) 163-169. CrossRef
L.P. Lisovik, Nondeterministic systems and finite substitutions on regular language. Bull. European Assoc. Theoret. Comput. Sci. (1997) 156-160.
Turakainen, P., The undecidability of some equivalence problems concerning ngsm's and finite substitutions. Theoret. Comput. Sci. 174 (1997) 269-274. CrossRef