Representations of transitive graphs by automata

dc.contributor.advisor	Khoussainov, B	en
dc.contributor.author	Berdinskiy, Dmitry	en
dc.date.accessioned	2017-06-20T02:38:13Z	en
dc.date.issued	2017	en
dc.identifier.uri	http://hdl.handle.net/2292/33639	en
dc.description.abstract	This thesis contributes to the eld of automatic structures and contains a collection of new results on representations of transitive graphs by automata. The results obtained in this thesis lay at the junction of group theory and formal language theory.	en
dc.publisher	ResearchSpace@Auckland	en
dc.relation.ispartof	PhD Thesis - University of Auckland	en
dc.relation.isreferencedby	UoA99264922009302091	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/3.0/nz/	en
dc.title	Representations of transitive graphs by automata	en
dc.type	Thesis	en
thesis.degree.discipline	Computer Science	en
thesis.degree.grantor	The University of Auckland	en
thesis.degree.level	Doctoral	en
thesis.degree.name	PhD	en
dc.rights.holder	Copyright: The author	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en
pubs.elements-id	631418	en
pubs.record-created-at-source-date	2017-06-20	en
dc.identifier.wikidata	Q112931994

Files in this item

Name: whole.pdf

Size: 1.274Mb

Format: PDF