暂无分享,去创建一个
[1] M. W. Shields. An Introduction to Automata Theory , 1988 .
[2] On Isoperimetric Profiles of Finitely Generated Groups , 2003 .
[3] Dmitry Berdinsky,et al. On Automatic Transitive Graphs , 2014, Developments in Language Theory.
[4] Gilbert Baumslag,et al. Wreath products and finitely presented groups , 1961 .
[5] Murray Elder,et al. Thompson's group F is 1-counter graph automatic , 2016, Groups Complex. Cryptol..
[6] S. Cleary,et al. Dead end words in lamplighter groups and other wreath products , 2003, math/0309344.
[7] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[8] Robert Gilman Michael Shapiro. On groups whose word problem is solved by a nested stack automaton , 1998 .
[9] An example of the rate of growth for a random walk on a group , 1999 .
[10] Alexei G. Myasnikov,et al. From automatic structures to automatic groups , 2011, ArXiv.
[11] On the asymptotics of drift , 2001, math/0101031.
[12] Anil Nerode,et al. Automatic Presentations of Structures , 1994, LCC.
[13] Gilbert Baumslag,et al. Parallel poly-pushdown groups , 1997 .
[14] Achim Blumensath,et al. Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[15] Walter Parry,et al. Growth series of some wreath products , 1992 .
[16] M. I. Kargapolov,et al. Fundamentals of the theory of groups , 1979 .