3 citations · 6 across the 7 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2020★ 3 cited
Regular matching problems for infinite trees
Carlos Camino, Volker Diekert, Besik Dundua +2
We study the matching problem of regular tree languages, that is, "?" where are regular tree languages over the union of finite ranked alphabets $Σ…
cs.FL2014
Learning cover context-free grammars from structural data
Mircea Marin, Gabriel Istrate
We consider the problem of learning an unknown context-free grammar when the only knowledge available and of interest to the learner is about its structural descriptions with depth…