Now showing items 31-36 of 36
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 ...
Complexity of Suffix-Free Regular Languages
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
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
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 ...
(Association for Computing Machinery, 2016-07-01)
We propose a novel surface-only technique for simulating incompressible, inviscid and uniform-density liquids with surface tension in three dimensions. The liquid surface is captured by a triangle mesh on which a Lagrangian ...
Towards a Trait Model of Video Game Preferences
(Taylor & Francis, 2018-04-19)
Typologies for understanding players’ preferences toward different gameplay styles have gained popularity in research. However, attempts to model players’ preferences are based on type models instead of trait models, ...