Patterns with bounded treewidth [internal report]
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 substi- tuting 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 langua...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Default Text |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/10118 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|