19 citations · 60 across the 17 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
Three Ways to Count Walks in a Digraph
Matthew Yancey
We approach the problem of counting the number of walks in a digraph from three different perspectives: enumerative combinatorics, linear algebra, and symbolic dynamics.
cs.FL2016★ 4 cited
Regular Language Distance and Entropy
Austin J. Parker, Kelly B. Yancey, Matthew P. Yancey
This paper addresses the problem of determining the distance between two regular languages. It will show how to expand Jaccard distance, which works on finite sets, to potentially-…