Now showing items 1-2 of 2
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
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 ...
On The Complexity Of The Evaluation Of Transient Extensions Of Boolean Functions
(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 ...