Representations of transitive graphs by automata

Show simple item record

dc.contributor.advisor Khoussainov, B en Berdinskiy, Dmitry en 2017-06-20T02:38:13Z en 2017 en
dc.identifier.uri 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 en
dc.rights.uri en
dc.title Representations of transitive graphs by automata en
dc.type Thesis en Computer Science en The University of Auckland en Doctoral en PhD en
dc.rights.holder Copyright: The author en
dc.rights.accessrights en
pubs.elements-id 631418 en
pubs.record-created-at-source-date 2017-06-20 en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace