Now showing items 1-4 of 4
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 ...
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 ...