Browsing Waterloo Research by Author "Li, Baiyu"
Now showing items 1-6 of 6
-
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 ... -
Quotient Complexity of Ideal Languages
Brzozowski, Janusz; Jirásková, Galina; Li, Baiyu (Elsevier, 2013-01-28)A language L over an alphabet Σ is a right (left) ideal if it satisfies L=LΣ∗ (L=Σ∗L). It is a two-sided ideal if L=Σ∗LΣ∗, and an all-sided ideal if L=Σ∗L, the shuffle of Σ∗ with L. Ideal languages are not only of interest ... -
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, ... -
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 R- And J-Trivial Regular Languages
Brzozowski, Janusz; Li, Baiyu (World Scientific Publishing, 2014-11-01)The syntactic complexity of a subclass of the class of regular languages is the maximal cardinality of syntactic semigroups of languages in that class, taken as a function of the state complexity n of these languages. We ...