Now showing items 1-1 of 1

    • Complexity of Suffix-Free Regular Languages 

      Brzozowski, Janusz; Szykuła, Marek (Elsevier, 2017-11-01)
      We study various complexity properties of suffix-free regular languages. A sequence (Lk,Lk+1,…) of regular languages in some class, where n is the quotient complexity of Ln, is most complex if its languages Ln meet the ...


      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