Browsing Theses by Subject "automata theory"
Now showing items 1-5 of 5
-
Control of Non-deterministic Transition Systems for Linear Temporal Logic Specifications
(University of Waterloo, 2021-02-01)Consider the formal synthesis problem in the continuous dynamical systems. A systematic approach is the abstraction-based method: constructing an abstraction of the original continuous system in the discrete space, and ... -
Counting, Adding, and Regular Languages
(University of Waterloo, 2018-12-17)In this thesis we consider two mostly disjoint topics in formal language theory that both involve the study and use of regular languages. The first topic lies in the intersection of automata theory and additive number ... -
A guide to F-automatic sets
(University of Waterloo, 2021-09-08)A self-contained introduction to the theory of F-automatic sets is given. Building on [Bell, Moosa, F-sets and finite automata, Journal de théorie des nombres de Bordeaux, 2019], contributions are made to both the foundations ... -
Problems Related to Shortest Strings in Formal Languages
(University of Waterloo, 2010-05-11)In formal language theory, studying shortest strings in languages, and variations thereof, can be useful since these strings can serve as small witnesses for properties of the languages, and can also provide bounds for ... -
Proving Properties of Fibonacci Representations via Automata Theory
(University of Waterloo, 2024-01-22)In this work, we introduce a novel framework for mechanically testing the completeness and unambiguity of Fibonacci-based representations via automata theory. We call a representation (or a number system) complete and ...