Now showing items 1-4 of 4

    • 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 ...
    • Large Aperiodic Semigroups 

      Brzozowski, Janusz; Szykuła, 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 Complexity of Regular Ideals 

      Brzozowski, Janusz; Szykuła, Marek; Ye, Yuli (Springer, 2017-08-04)
      The state complexity of a regular language is the number of states in a minimal deterministic finite automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic ...
    • Syntactic Complexity of Suffix-Free Languages 

      Brzozowski, Janusz; Szykuła, Marek (Elsevier, 2017-09-05)
      We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with n left quotients (that is, with state complexity n) is at most (n−1)n−2+n−2 ...


      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