Regulated Tree Automata - Descriptional Complexity of Formal Systems Access content directly
Conference Papers Year : 2019

Regulated Tree Automata

Henning Fernau
  • Function : Author
  • PersonId : 857693
Martin Vu
  • Function : Author
  • PersonId : 1059502

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.
Fichier principal
Vignette du fichier
480958_1_En_9_Chapter.pdf (350.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02387294 , version 1 (29-11-2019)

Licence

Attribution

Identifiers

Cite

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⟩
72 View
43 Download

Altmetric

Share

Gmail Facebook X LinkedIn More