%0 Conference Proceedings
%T Regulated Tree Automata
%+ Trier University
%A Fernau, Henning
%A Vu, Martin
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Košice, Slovakia
%Y Michal Hospodár
%Y Galina Jirásková
%Y Stavros Konstantinidis
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-11612
%P 124-136
%8 2019-07-17
%D 2019
%R 10.1007/978-3-030-23247-4_9
%K Regulated rewriting
%K Graph control
%K Tree automata
%K Yield operation
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.02
%2 https://inria.hal.science/hal-02387294/document
%2 https://inria.hal.science/hal-02387294/file/480958_1_En_9_Chapter.pdf
%L hal-02387294
%U https://inria.hal.science/hal-02387294
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-11612