Now showing items 1-2 of 2

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


      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