Now showing items 1-3 of 3
Syntactic Complexities of Six Classes of Star-Free Languages
(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, ...
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 ...
Quotient Complexity Of Star-Free Languages
(World Scientific Publishing, 2012-09-01)
The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the ...