Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
نویسندگان
چکیده
A language L over an alphabet Σ is suffix-convex if, for any words x, y, z ∈ Σ∗, whenever z and xyz are in L, then so is yz. Suffixconvex languages include three special cases: left-ideal, suffix-closed, and suffix-free languages. We examine complexity properties of these three special classes of suffix-convex regular languages. In particular, we study the quotient/state complexity of boolean operations, product (concatenation), star, and reversal on these languages, as well as the size of their syntactic semigroups, and the quotient complexity of their atoms.
منابع مشابه
Syntactic Complexity of Ideal and Closed Languages
The state complexity of a regular language is the number of states in the minimal deterministic automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the worst-case syntactic complexity taken as a function of the state complexity n of languages in that class. ...
متن کاملSyntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
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 that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. We...
متن کاملTechnical Report No. 2007-534 State Complexity of Basic Operations on Suffix-Free Regular Languages
We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene...
متن کاملComplexity of Suffix-Free Regular Languages
We study various complexity properties of suffix-free regular languages. The quotient complexity of a regular language L is the number of left quotients of L; this is the same as the state complexity of L, which is the number of states in a minimal deterministic finite automaton (DFA) accepting L. A regular language L′ is a dialect of a regular language L if it differs only slightly from L (for...
متن کاملSyntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
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 that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, and bifix-free regular languages. We prove th...
متن کامل