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.
| Identifer | oai:union.ndltd.org:AUCKLAND/oai:researchspace.auckland.ac.nz:2292/1262 |
| Date | January 2004 |
| Creators | Rubin, Sasha |
| Contributors | Bakhadyr Khoussainov |
| Publisher | ResearchSpace@Auckland |
| Source Sets | University of Auckland |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | Scanned from print thesis |
| Rights | Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated., http://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm, Copyright: The author |
| Relation | PhD Thesis - University of Auckland, UoA1239510 |
Page generated in 0.0021 seconds