https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:10978 Wed 25 Sep 2024 08:57:30 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:9976 Wed 11 Apr 2018 15:20:32 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:14202 Tue 15 Oct 2024 16:32:49 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:24783 F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to -graph automatic by the authors, a compelling question is whether F is graph automatic or C-graph automatic for an appropriate language class C. The extended definitions allow the use of a symbol alphabet for the normal form language, replacing the dependence on generating set. In this paper we construct a 1-counter graph automatic structure for F based on the standard infinite normal form for group elements.]]> Sat 24 Mar 2018 07:14:06 AEDT ]]>