Now showing items 1-9 of 9

    • Complexity Of Atoms Of Regular Languages 

      Brzozowski, Janusz; Tamm, Hellis (World Scientific Publishing, 2013-11-01)
      The quotient complexity of a regular language L, which is the same as its state complexity the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a non-empty intersection of the n ...
    • Complexity of proper prefix-convex regular languages 

      Brzozowski, Janusz A.; Sinnamon, Corwin (Elsevier, 2019-10-01)
      A language L over an alphabet Σ is prefix-convex if, for any words x,y,z ∈ Σ*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free languages, which were ...
    • Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages 

      Brzozowski, Janusz; Sinnamon, Corwin (Institute of Informatics: University of Szeged, 2017)
      A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free ...
    • In Search Of Most Complex Regular Languages 

      Brzozowski, Janusz (World Scientific Publishing, 2013-09-01)
      Sequences (L-n vertical bar n >= k), called streams, of regular languages L-n are considered, where k is some small positive integer, n is the state complexity of L-n, and the languages in a stream differ only in the ...
    • Most Complex Regular Ideal Languages 

      Liu, Bo Yang Victor; Davies, Sylvie; Brzozowski, Janusz (Discrete Mathematics and Theoretical Computer Science, 2016-10-17)
      A right ideal (left ideal, two-sided ideal) is a non-empty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for ...
    • Most Complex Regular Right-Ideal Languages 

      Brzozowski, Janusz; Davies, Gareth (Springer, 2014)
      A right ideal is a language L over an alphabet Sigma that satisfies the equation L = L Sigma*. We show that there exists a sequence (Rn vertical bar n >= 3) of regular right-ideal languages, where R-n has n left quotients ...
    • Quotient Complexities of Atoms in Regular Ideal Languages 

      Brzozowski, Janusz; Davies, Sylvie (Institute of Informatics: University of Szeged, 2015)
      A (left) quotient of a language L by a word w is the language w(-1) L = {x vertical bar wx is an element of L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state ...
    • 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, ...

      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