dc.contributor.advisor |
Bakhadyr Khoussainov |
en |
dc.contributor.author |
Rubin, Sasha |
en |
dc.date.accessioned |
2007-08-06T05:09:42Z |
en |
dc.date.available |
2007-08-06T05:09:42Z |
en |
dc.date.issued |
2004 |
en |
dc.identifier |
THESIS 04-400 |
en |
dc.identifier.citation |
Thesis (PhD--Mathematics)--University of Auckland, 2004. |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/1262 |
en |
dc.description.abstract |
This thesis investigates structures that are presentable by finite automata working synchronously on tuples of finite words. The emphasis is on understanding the expressiveness and limitations of automata in this setting. In particular, the thesis studies the classification of classes of automatic structures, the complexity of the isomorphism problem, and the relationship between definability and recognisability. |
en |
dc.format |
Scanned from print thesis |
en |
dc.language.iso |
en |
en |
dc.publisher |
ResearchSpace@Auckland |
en |
dc.relation.ispartof |
PhD Thesis - University of Auckland |
en |
dc.relation.isreferencedby |
UoA1239510 |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Automatic structures |
en |
dc.type |
Thesis |
en |
thesis.degree.discipline |
Mathematics |
en |
thesis.degree.grantor |
The University of Auckland |
en |
thesis.degree.level |
Doctoral |
en |
thesis.degree.name |
PhD |
en |
dc.subject.marsden |
Fields of Research::230000 Mathematical Sciences::230100 Mathematics |
en |
dc.rights.holder |
Copyright: The author |
en |
pubs.local.anzsrc |
01 - Mathematical Sciences |
en |
pubs.org-id |
Faculty of Science |
en |
dc.identifier.wikidata |
Q111964130 |
|