Bad news on decision problems for patterns
We study the inclusion problem for pattern languages, which is shown to be undecidable by Jiang et al. (J. Comput. System Sci. 50, 1995). More precisely, Jiang et al. demonstrate that there is no effective procedure deciding the inclusion for the class of all pattern languages over all alphabets. Mo...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Default Article |
| Published: |
2008
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/3674 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|