JavaScript is disabled for your browser. Some features of this site may not work without it.

## Computability and Complexity Properties of Automatic Structures and their Applications

dc.contributor.author | Minnes, Mor Mia | |

dc.date.accessioned | 2008-05-16T20:46:28Z | |

dc.date.available | 2013-05-16T06:21:46Z | |

dc.date.issued | 2008-05-16T20:46:28Z | |

dc.identifier.uri | https://hdl.handle.net/1813/10820 | |

dc.description.abstract | Finite state automata are Turing machines with fixed finite bounds on resource use. Automata lend themselves well to real-time computations and efficient algorithms. Continuing a tradition of studying computability in mathematics, we examine automatic structures, mathematical objects which can be represented by automata, and apply resulting observations to computer science. We measure the complexity of automatic structures via well-established concepts from model theory, topology, and set theory. We prove the following results. The ordinal height of any automatic well-founded partial order is bounded by \omega^\omega. The ordinal heights of automatic well-founded relations are unbounded below the first uncomputable ordinal. For any computable ordinal, there is an automatic structure of Scott rank at least that ordinal. Moreover, there are automatic structures of Scott rank the first uncomputable ordinal and the successor of the first uncomputable ordinal. For any computable ordinal, there is an automatic successor tree of Cantor-Bendixson rank that ordinal. Next, we study infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations have finite degree and can be described by finite automata over a one-letter alphabet. We investigate algorithmic properties of such graphs in terms of their finite presentations. In particular, we ask how hard it is to check whether a given node belongs to an infinite component, whether two given nodes in the graph are reachable from one another, and whether the graph is connected. We give polynomial-time algorithms answering each of these questions. For a fixed input graph, the algorithm for infinite component membership works in constant time and reachability is decided uniformly by a single automaton. Hence, we improve on previous work, in which nonelementary or nonuniform algorithms were found. We turn our attention to automata techniques for deciding first-order logical theories. These techniques are useful in Integer Linear Programming and Mixed Integer Linear Programming, which in turn have applications in diverse areas of computer science and engineering. We extend known work to address the enumeration problem for linear programming solutions. Then, we apply a similar paradigm to give an automata theoretic decision procedure for the p-adic valued ring under addition and for formal Laurent series over a finite field with valuation and addition. | en_US |

dc.language.iso | en_US | en_US |

dc.relation.isformatof | bibid: 6397140 | |

dc.subject | Mathematical Logic | en_US |

dc.subject | Theoretical Computer Science | en_US |

dc.subject | Finite automata | en_US |

dc.subject | Computable model theory | en_US |

dc.title | Computability and Complexity Properties of Automatic Structures and their Applications | en_US |

dc.type | dissertation or thesis | en_US |