Now showing items 1-2 of 2

    • Complexity Of Atoms Of Regular Languages 

      Brzozowski, Janusz; Tamm, Hellis (World Scientific Publishing, 2013-11-01)
      The quotient complexity of a regular language L, which is the same as its state complexity the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a non-empty intersection of the n ...
    • Theory Of Atomata 

      Brzozowski, Janusz; Tamm, Hellis (Elsevier, 2014-06-19)
      We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "atomaton", whose states are the "atoms" of the language, that is, non-empty intersections of complemented or ...


      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