Undecidability of the equivalence of finite substitutions on regular language

Theoretical Informatics and Applications

Volumn 33, Issue 2, 1999, Pages 117-124

  Halava, Vesa ^a   Harju, Tero ^b  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DATA STRUCTURES; FINITE AUTOMATA; MATHEMATICAL MORPHOLOGY; NATURAL LANGUAGE PROCESSING SYSTEMS; PROBLEM SOLVING; THEOREM PROVING;

FINITE SUBSTITUTIONS; INTEGER WEIGHTED FINITE AUTOMATA;

EQUIVALENCE CLASSES;

EID: 0033295152     PISSN: 09883754     EISSN: None     Source Type: Journal    
DOI: 10.1051/ita:1999109     Document Type: Article

References (5)

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