The language of self-avoiding walks
From MaRDI portal
Publication:2658381
DOI10.1007/s00493-020-4184-zzbMath1488.05349arXiv1903.02368OpenAlexW3022037472MaRDI QIDQ2658381
Wolfgang Woess, Christian Lindorfer
Publication date: 20 March 2021
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.02368
Related Items
Self-avoiding walks and multiple context-free languages ⋮ Realizable cycle structures in digraphs ⋮ A general bridge theorem for self-avoiding walks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- Context-free pairs of groups. I: Context-free pairs and graphs
- Multipass automata and group word problems
- Context-free pairs of groups. II: Cuts, tree sets, and random walks
- Automorphism groups of context-free graphs
- Counting self-avoiding walks on free products of graphs
- Groups, the theory of ends, and context-free languages
- Fragments and automorphisms of infinite graphs
- Automorphism groups of graphs as topological groups
- The theory of ends, pushdown automata, and second-order logic
- A survey on graphs with polynomial growth
- A note on the growth of transitive graphs
- Vertex-transitive graphs and accessibility
- The structure of locally finite two-connected graphs
- Self-avoiding walks, the language of science, and Fibonacci numbers
- Über unendliche Wege in Graphen
- Automorphisms and endomorphisms of infinite locally finite graphs
- Über die Enden diskreter Räume und Gruppen
- Vertex Cuts
- Growth and ergodicity of context-free languages
- On a Class of Fixed-Point-Free Graphs
- Random self-avoiding walks on one-dimensional lattices
- The Language of Self-Avoiding Walks
- CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES
- Random Walks on Infinite Graphs and Groups
- Lectures on Self-Avoiding Walks
