Finitely generated semiautomatic groups
暂无分享,去创建一个
[1] S. Barry Cooper,et al. The machine as data: a computational view of emergence and definability , 2015, Synthese.
[2] A. Myasnikov,et al. Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic , 2012, LATA.
[3] Dmitry Berdinsky,et al. On Automatic Transitive Graphs , 2014, Developments in Language Theory.
[4] A. Nies,et al. FA-presentable groups and rings , 2008 .
[5] John S. Rose. A Course on Group Theory , 2012 .
[6] Z. Sunic,et al. The conjugacy problem in automaton groups is not solvable , 2010, 1010.1993.
[7] John Case,et al. Automatic functions, linear time and learning , 2013, Log. Methods Comput. Sci..
[8] Leonard M. Adleman,et al. NP-Complete Decision Problems for Binary Quadratics , 1978, J. Comput. Syst. Sci..
[9] George Barmpalias,et al. Post's Programme for the Ershov Hierarchy , 2007, J. Log. Comput..
[10] Graham P. Oliver,et al. Automatic Presentations for Finitely Generated Groups , 2005, STACS.
[11] Sanjay Jain,et al. Finitely Generated Semiautomatic Groups , 2016, CiE.
[12] Angsheng Li,et al. A Roadmap for TAMC , 2014, TAMC.
[13] Alexei G. Myasnikov,et al. From automatic structures to automatic groups , 2011, ArXiv.
[14] Anil Nerode,et al. Automatic Presentations of Structures , 1994, LCC.