Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs
We present a generating-function approach to the topological entropy of finite strongly connected digraphs, working throughout with digraphs in which loops are allowed but multiple edges are excluded. Using dominant singularities of path-generating functions, we recover by new analytic--combinatorial arguments the know...