Quotient Complexity of Ideal Languages

نویسندگان

  • Janusz A. Brzozowski
  • Galina Jirásková
  • Baiyu Li
چکیده

We study the state complexity of regular operations in the class of ideal languages. A language L ⊆ Σ∗ 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. We prefer the term “quotient complexity” instead of “state complexity”, and we use derivatives to calculate upper bounds on quotient complexity, whenever it is convenient. We find tight upper bounds on the quotient complexity of each type of ideal language in terms of the complexity of an arbitrary generator and of its minimal generator, the complexity of the minimal generator, and also on the operations union, intersection, set difference, symmetric difference, concatenation, star and reversal of ideal languages.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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

متن کامل

Complexity of Prefix-Convex Regular Languages

A language L over an alphabet Σ is prefix-convex if, for any words x, y, z ∈ Σ, whenever x and xyz are in L, then so is xy. Prefix-convex languages include right-ideal, prefixclosed, and prefix-free languages. We study complexity properties of prefix-convex regular languages. In particular, we find the quotient/state complexity of boolean operations, product (concatenation), star, and reversal,...

متن کامل

Most Complex Regular Ideals

A right ideal (left ideal, two-sided ideal) is a non-empty language L over an alphabet Σ such that L = LΣ∗ (L = Σ∗L, L = Σ∗LΣ∗). Let k = 3 for right ideals, 4 for left ideals and 5 for two-sided ideals. We show that there exist sequences (Ln | n > k) of right, left, and two-sided regular ideals, where Ln has quotient complexity (state complexity) n, such that Ln is most complex in its class und...

متن کامل

Quotient Complexities of Atoms in Regular Ideal Languages

A (left) quotient of a language L by a word w is the language wL = {x | wx ∈ L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state complexity of L, which is the number of states in a minimal deterministic finite automaton accepting L. An atom of L is an equivalence class of the relation in which two words are equivalent if for each quotien...

متن کامل

Quotient Complexity of Star-Free Languages

The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the language resulting from the operation, as a function of the quotient complexities of the operands. The class of star-free languages is the smallest class containing the finite la...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 470  شماره 

صفحات  -

تاریخ انتشار 2010