10 citations · 74 across the 27 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2024
Strongly k-recursive sequences
Daniel Krenn, Jeffrey Shallit
Drawing inspiration from a recent paper of Heuberger, Krenn, and Lipnik, we define the class of strongly k-recursive sequences. We show that every k-automatic sequence is strongly…
cs.FL2020★ 2 cited
Decidability and k-Regular Sequences
Daniel Krenn, Jeffrey Shallit
In this paper we consider a number of natural decision problems involving k-regular sequences. Specifically, they arise from - lower and upper bounds on growth rate; in particular…
cs.FL2014★ 5 cited
Automata in SageMath---Combinatorics meet Theoretical Computer Science
Clemens Heuberger, Daniel Krenn, Sara Kropf
The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit…