Patterns with bounded treewidth
A pattern is a string consisting of variables and terminal symbols, and its language is the set of all words that can be obtained by substituting arbitrary words for the variables. The membership problem for pattern languages, i.e., deciding on whether or not a given word is in the pattern language...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Default Article |
| Published: |
2014
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/16579 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|