Now showing items 1-2 of 2

    • 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 ...

      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