no code implementations • 4 Jan 2021 • Corentin Barloy, Lorenzo Clemente
We show that the orbit-counting function satisfies a system of bidimensional linear recursive equations with polynomial coefficients (linrec), which generalises analogous recurrences for the Stirling numbers of the second kind, and then we show that universality reduces to the zeroness problem for linrec sequences.
Formal Languages and Automata Theory
1 code implementation • 24 Oct 2012 • Lorenzo Clemente, Richard Mayr
The algorithm is based on new transition pruning techniques.
Formal Languages and Automata Theory Data Structures and Algorithms 68Q45 D.2.4; F.1.1
