## Search

Now showing items 11-16 of 16

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

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

#### Complexity of Suffix-Free Regular Languages

(Elsevier, 2017-11-01)

We study various complexity properties of suffix-free regular languages. A sequence (Lk,Lk+1,…) of regular languages in some class, where n is the quotient complexity of Ln, is most complex if its languages Ln meet the ...

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

#### Syntactic Complexity of Suffix-Free Languages

(Elsevier, 2017-09-05)

We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with n left quotients (that is, with state complexity n) is at most (n−1)n−2+n−2 ...