Collapsible pushdown automata and recursion schemes
<p>We consider recursion schemes (not assumed to be homogeneously typed, and hence not necessarily safe) and use them as generators of (possibly infinite) ranked trees. A recursion scheme is essentially a finite typed deterministic term rewriting system that generates, when one applies the rew...
| প্রধান লেখক: | , , , |
|---|---|
| বিন্যাস: | Journal article |
| প্রকাশিত: |
Association for Computing Machinery
2017
|