Deterministic tree pushdown automata and monadic tree rewriting systems☆
Under an Elsevier user license
open archive
Cited by (0)
- ☆
This research was performed while the author was visiting the Department of Mathematics, University of California, Santa Barbara. It was supported in part by the Academy of Finland, the ASLA/Fulbright Foundation, and by the National Science Foundation under Grant DCR8314977.
Copyright © 1988 Published by Elsevier Inc.