Now showing items 1-3 of 3

    • Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages 

      Brzozowski, Janusz; Sinnamon, Corwin (Springer, 2017-03-06)
      A language L over an alphabet Σ is suffix-convex if, for any words x,y,z∈Σ∗, whenever z and xyz are in L, then so is yz. Suffix-convex languages include three special cases: left-ideal, suffix-closed, and suffix-free ...
    • Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages 

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