The Language of Self-Avoiding Walks-Reference-Cited by-同舟云学术

The Language of Self-Avoiding Walks

Published:2020-04-28 Issue:5 Volume:40 Page:691-720
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Lindorfer Christian,Woess Wolfgang

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

https://link.springer.com/content/pdf/10.1007/s00493-020-4184-z.pdf

Reference35 articles.

1. S. E. Alm and S. Janson: Random self-avoiding walks on one-dimensional lattices, Comm. Statist. Stochastic Models6 (1990), 169–212.

2. A. V. Anisimov: Group languages, Kibernetika4 (1971), 18–24.

3. R. Bauerschmidt, H. Duminil-Copin, J. Goodman and G. Slade: Lectures on self-avoiding walks, in: Probability and Statistical Physics in Two and more Dimensions, 395–467, Clay Math. Proc. 15, Amer. Math. Soc., Providence, RI, 2012.

4. T. Ceccherini-Silberstein, M. Coornaert, F. Fiorenzi, P. E. Schupp and N. W. M. Touikan: Multipass automata and group word problems, Theoret. Comput. Sci.600 (2015), 19–33.

5. T. Ceccherini-Silberstein and W. Woess: Growth and ergodicity of context-free languages, Trans. Amer. Math. Soc.354 (2002), 4597–4625.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalizations of the Muller–Schupp theorem and tree‐like inverse graphs;Journal of the London Mathematical Society;2024-04-25

2. Realizable cycle structures in digraphs;European Journal of Combinatorics;2023-10

3. A general bridge theorem for self-avoiding walks;Discrete Mathematics;2020-12