******* UWSpace has been experiencing unusually long wait times during the depositing process. If you are a graduate student depositing a thesis, it is recommended that while the browser is loading that you do not try to close the connection. If you receive an error or a timeout message, please logout and then log back in. Please do not continually try to resubmit, or recreate and resend a new thesis deposit. In most cases, despite the error message, your deposit has successfully been sent to be reviewed. You can verify this by checking under the ‘deposits being reviewed' page after logging back in, or by contacting UWSpace. We apologize for the inconvenience. We are working hard to resolve this issue quickly. *******

## Search

Now showing items 1-10 of 23

#### Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages

(Institute of Informatics: University of Szeged, 2017)

A language L over an alphabet E is prefix-convex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefix-closed, and prefix-free ...

#### Large Aperiodic Semigroups

(World Scientific Publishing, 2015-11-01)

We search for the largest syntactic semigroups of star-free languages having n left quotients; equivalently, we look for the largest transition semigroups of aperiodic finite automata with n states. We first introduce ...

#### In Search Of Most Complex Regular Languages

(World Scientific Publishing, 2013-09-01)

Sequences (L-n vertical bar n >= k), called streams, of regular languages L-n are considered, where k is some small positive integer, n is the state complexity of L-n, and the languages in a stream differ only in the ...

#### Complexity Of Atoms Of Regular Languages

(World Scientific Publishing, 2013-11-01)

The quotient complexity of a regular language L, which is the same as its state complexity the number of left quotients of L. An atom of a non-empty regular language L with n quotients is a non-empty intersection of the n ...

#### Syntactic Complexity of Regular Ideals

(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 ...

#### Quotient Complexities of Atoms in Regular Ideal Languages

(Institute of Informatics: University of Szeged, 2015)

A (left) quotient of a language L by a word w is the language w(-1) L = {x vertical bar wx is an element of L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state ...

#### Quotient Complexity Of Closed Languages

(Springer, 2014-02-01)

A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in an analogous way, where by factor we mean contiguous subsequence, ...

#### 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 ...

#### Syntactic Complexity Of R- And J-Trivial Regular Languages

(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 ...