Loading…
On the learnability of E-pattern languages over small alphabets
This paper deals with two well discussed, but largely open problems on E-pattern languages, also known as extended or erasing pattern languages: primarily, the learnability in Gold’s learning model and, secondarily, the decidability of the equivalence. As the main result, we show that the full class...
Saved in:
| Main Author: | |
|---|---|
| Format: | Default Article |
| Published: |
2004
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/3470 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|