Now showing items 1-4 of 4

    • Algebraic Approaches to State Complexity of Regular Operations 

      Davies, Sylvie (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 ...
    • Establishing a Connection Between Graph Structure, Logic, and Language Theory 

      Hunt, Alexis (University of Waterloo, 2015-09-08)
      The field of graph structure theory was given life by the Graph Minors Project of Robertson and Seymour, which developed many tools for understanding the way graphs relate to each other and culminated in the proof of the ...
    • Monoids and the State Complexity of the Operation root(<i>L</i>) 

      Krawetz, Bryan (University of Waterloo, 2004)
      In this thesis, we cover the general topic of state complexity. In particular, we examine the bounds on the state complexity of some different representations of regular languages. As well, we consider the state ...
    • Problems Related to Shortest Strings in Formal Languages 

      Ang, Thomas (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 ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages