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.
https://hal.inria.fr/hal-02387294 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Friday, November 29, 2019 - 4:35:53 PM Last modification on : Friday, November 29, 2019 - 5:01:51 PM
Henning Fernau, Martin Vu. Regulated Tree Automata. 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.124-136, ⟨10.1007/978-3-030-23247-4_9⟩. ⟨hal-02387294⟩