Now showing items 1-3 of 3

    • On The Complexity Of The Evaluation Of Transient Extensions Of Boolean Functions 

      Brzozowski, Janusz; Li, Baiyu; Ye, Yuli (World Scientific Publishing, 2012-01-01)
      Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions ...
    • 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 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 ...

      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