Safety is not a restriction at level 2 for string languages
Recent work by Knapik, Niwinski and Urzczyn [KNU02] has revived interest in the connexions between higher-order grammars and higher-order pushdown automata. Both devices can be viewed as definitions for term trees as well as string languages. In the latter setting we recall the extensive study by Da...
| Main Authors: | , , |
|---|---|
| Format: | Report |
| Published: |
Oxford University Computing Laboratory
2004
|