On a lemma of Gromov and the entropy of a graph

DOI10.1006/eujc.2002.0567zbMath1017.05062OpenAlexW2047104287WikidataQ124802028 ScholiaQ124802028MaRDI QIDQ1864577

Fabio Scarabotti

Publication date: 18 March 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2002.0567

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

On the entropy of regular languages. ⋮ Growth and ergodicity of context-free languages II: The linear case ⋮ VISCOELASTIC PROPERTIES OF NETWORKS

Cites Work

• Endomorphisms of symbolic algebraic varieties
• An Introduction to Symbolic Dynamics and Coding

This page was built for publication: On a lemma of Gromov and the entropy of a graph