Now showing items 1-1 of 1

    • Syntactic Complexity Of R- And J-Trivial Regular Languages 

      Brzozowski, Janusz; Li, Baiyu (World Scientific Publishing, 2014-11-01)
      The syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We ...

      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