Now showing items 1-2 of 2

    • Most Complex Non-returning Regular Languages 

      Brzozowski, Janusz; Davies, Sylvie (Springer, 2017-07-03)
      A regular language L is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jirásková derived upper bounds on the state complexity of ...
    • Unrestricted State Complexity Of Binary Operations On Regular And Ideal Languages 

      Brzozowski, Janusz; Sinnamon, Corwin (Institut für Informatik, 2017-08-27)
      We study the state complexity of binary operations on regular languages over different alphabets. It is known that if L′m and Ln are languages of state complexities m and n, respectively, and restricted to the same alphabet, ...

      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