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:ADTP/246910 |
Date | January 2004 |
Creators | Rubin, Sasha |
Publisher | ResearchSpace@Auckland |
Source Sets | Australiasian Digital Theses Program |
Language | English |
Detected Language | English |
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 |
Page generated in 0.0052 seconds