Rebootable and suffix - closed ω - power languages

نویسندگان

  • B. LE SAËC
  • I. LITOVSKY
چکیده

The (ü-languages R» such that (1) Pref(7?)i? = 7?, (2) Suî(R) = R or (3) Pref^R") Suf (R*) = R* are characterized via properties of the language Stab (R) = { u e S* : u R <= R°} and via proper ties of (O-generators ofR®. Nicely, each char acier ïzation for (1) provides one for (2) and (3) by replacing "prefix" by "suffix" and "factor", respectively. Moreover (3) characterizes the (ö-languages RTM which are left (à-ideals in AlhÇ) Résumé. Les a-languages R<* tels que (1) Pref(^)i? = R°, (2) Suf(iT) = 7P on (3) PreftR") Suf (R) ~ R sont caractérisés au moyen de propriétés du langage Stab (R) = { w G D* : u R® cz R } et au moyen de propriétés des (ù-générateurs de R. Toute caractërisation pour (1) fournit une caractèrisation pour (2) et (3) en remplaçant «préfixe » pour « suffixe » on «facteur », selon les cas. De plus (3) caractérise les ^-langages RTM gui sont des (û-idéaux à gauche de Alph (RTM).

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

ثبت نام

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

منابع مشابه

Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages

In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...

متن کامل

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

متن کامل

Expected Compression Ratio for DFCA: experimental average case analysis

In this paper we investigate from a statistical point of view the expected compression ratio between the size of a minimal Deterministic Finite Cover Automaton (DFCA) and the size of the minimal corresponding Determinitic Finite Automaton (DFA). Using sound statistical methods, we extend the experimental study done in [16], thus obtaining a much better picture of the compression power of DFCAs....

متن کامل

Conditional Lindenmayer Systems with Subregular Conditions: The Extended Case

We study the generative power of extended conditional Lindenmayer systems where the conditions are finite, monoidal, combinational, definite, nilpotent, strictly locally (k)-testable, commutative, circular, suffix-closed, starfree, and union-free regular languages. The results correspond to those obtained for conditional context-free languages.

متن کامل

Decision Problems for Convex Languages

We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a language L is prefix-, suffix-, factor-, or subword-convex in polynomial time if L is represented by a DFA, but the problem is PSPACE-hard if L is represented by an NFA. If a regular language is not convex, we prove tight u...

متن کامل

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


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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011