Back to Search
Start Over
Undecidability of the equivalence of finite substitutions on regular language
- Source :
- RAIRO - Theoretical Informatics and Applications. 33:117-124
- Publication Year :
- 1999
- Publisher :
- EDP Sciences, 1999.
-
Abstract
- A simplified proof is given for the following result due to Lisovik: it is undecidable for two given e –free finite substitutions, whether they are equivalent on the regular language b {0,1}* c .
Details
- ISSN :
- 1290385X and 09883754
- Volume :
- 33
- Database :
- OpenAIRE
- Journal :
- RAIRO - Theoretical Informatics and Applications
- Accession number :
- edsair.doi...........cbcfcb0c034f263db953a5c9e4e567a8