3 citations · 3 across the 1 of their papers we have counts for
2 papers
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.FL2020
On polynomial recursive sequences
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman +2
We study the expressive power of polynomial recursive sequences, a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the…