Closure properties of pattern languages
Pattern languages are a well-established class of languages that is particularly popular in algorithmic learning theory, but very little is known about their closure properties. In the present paper we establish a large number of closure properties of the terminal-free pattern languages, and we char...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Default Conference proceeding |
| Published: |
2014
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/16055 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|