Now showing items 1-4 of 4

    • Large Aperiodic Semigroups 

      Brzozowski, Janusz; Szykula, Marek (World Scientific Publishing, 2015-11-01)
      We search for the largest syntactic semigroups of star-free languages having n left quotients; equivalently, we look for the largest transition semigroups of aperiodic finite automata with n states. We first introduce ...
    • Syntactic Complexities of Six Classes of Star-Free Languages 

      Brzozowski, Janusz; Li, Baiyu; Liu, David (Otto-von-Guericke-Universit¨at Magdeburg, 2012)
      The syntactic complexity of a regular language is the cardinality of its syntactic semi-group. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ...
    • Syntactic Complexities of Some Classes of Star-Free Languages 

      Brzozowski, Janusz; Li, Baiyu (Springer, 2012)
      The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ...
    • 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