Complexity results on register context-free grammars and register tree automata
From MaRDI portal
Publication:1623153
DOI10.1007/978-3-030-02508-3_22OpenAlexW2895978543MaRDI QIDQ1623153
Yoshiaki Takata, Hiroyuki Seki, Ryoma Senda
Publication date: 23 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-02508-3_22
Related Items (4)
Reactive synthesis from visibly register pushdown automata ⋮ Complexity results on register context-free grammars and related formalisms ⋮ Active learning for deterministic bottom-up nominal tree automata ⋮ Optimal run problem for weighted register automata
This page was built for publication: Complexity results on register context-free grammars and register tree automata
