| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
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.
Cited literature [20 references]
https://hal.inria.fr/hal-02387294
Contributor : Hal Ifip Connect 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
Contributor : Hal Ifip Connect 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
File
480958_1_En_9_Chapter.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License