Browsing Mathematics (Faculty of) by Subject "Quotient complexity"
Now showing items 14 of 4

Complexity of Proper PrefixConvex Regular Languages
(Springer, 20170627)A language L over an alphabet Σ is prefixconvex if, for any words x,y,z∈Σ∗, whenever x and xyz are in L, then so is xy. Prefixconvex languages include rightideal, prefixclosed, and prefixfree languages, which were ... 
Quotient Complexity Of Closed Languages
(Springer, 20140201)A language L is prefixclosed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix, factor, and subwordclosed languages in an analogous way, where by factor we mean contiguous subsequence, ... 
Quotient Complexity of Ideal Languages
(Elsevier, 20130128)A language L over an alphabet Σ is a right (left) ideal if it satisfies L=LΣ∗ (L=Σ∗L). It is a twosided ideal if L=Σ∗LΣ∗, and an allsided ideal if L=Σ∗L, the shuffle of Σ∗ with L. Ideal languages are not only of interest ... 
Unrestricted State Complexity Of Binary Operations On Regular And Ideal Languages
(Institut für Informatik, 20170827)We study the state complexity of binary operations on regular languages over diﬀerent alphabets. It is known that if L′m and Ln are languages of state complexities m and n, respectively, and restricted to the same alphabet, ...