## Search

Now showing items 1-7 of 7

#### Quotient Complexity of Ideal Languages

(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 complexity of prefix-, suffix-, bifix-, and factor-free regular languages

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

#### Theory Of Atomata

(Elsevier, 2014-06-19)

We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "atomaton", whose states are the "atoms" of the language, that is, non-empty intersections of complemented or ...

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

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