Regulated Tree Automata
Abstract
Regulated rewriting is one of the classical areas in Formal Languages, as tree automata are a classical topic. Somewhat surprisingly, there have been no attempts so far to combine both areas. Here, we start this type of research, introducing regulated tree automata, proving in particular characterizations of the yields of such regulated automata.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|
Loading...
