Article contents
Undecidability of the equivalence of finite substitutions on regular language
Published online by Cambridge University Press: 15 August 2002
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 1999
References
- 6
- Cited by