Skip to Main content Skip to Navigation
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Friday, November 29, 2019 - 4:35:53 PM
Last modification on : Friday, November 29, 2019 - 5:01:51 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views