Browsing Theses by Subject "automata"
Now showing items 1-2 of 2
-
Algebraic Approaches to State Complexity of Regular Operations
(University of Waterloo, 2019-10-15)The state complexity of operations on regular languages is an active area of research in theoretical computer science. Through connections with algebra, particularly the theory of semigroups and monoids, many problems ... -
An Automaton-Theoretic View of Algebraic Specifications
(University of Waterloo, 2005)We compare two methods for software specification: <em>algebraic specifications</em> and automata. While algebraic specifications have been around since the 1970s and have been studied extensively, specification by ...