## Search

Now showing items 1-10 of 36

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

#### Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Language

(Institute of Informatics: University of Szeged, 2014)

A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are defined similarly, where by ``subword" we mean ``subsequence", ...

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

#### Time-consistent mean–variance portfolio optimization: A numerical impulse control approach

(Elsevier, 2018-11-01)

We investigate the time-consistent mean–variance (MV) portfolio optimization problem, popular in investment–reinsurance and investment-only applications, under a realistic context that involves the simultaneous application ...

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

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

#### Most Complex Regular Ideal Languages

(Discrete Mathematics and Theoretical Computer Science, 2016-10-17)

A right ideal (left ideal, two-sided ideal) is a non-empty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for ...

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

#### The use of machine learning algorithms in recommender systems: A systematic review

(Elsevier, 2018-05-01)

Recommender systems use algorithms to provide users with product or service recommendations. Recently, these systems have been using machine learning algorithms from the field of artificial intelligence. However, choosing ...

#### A Multi-scale Model for Simulating Liquid-hair Interactions

(Association for Computing Machinery, 2017-07-20)

The diverse interactions between hair and liquid are complex and span multiple length scales, yet are central to the appearance of humans and animals in many situations. We therefore propose a novel multi-component simulation ...