منابع مشابه
Operads, quasiorders and regular languages
We generalize the construction of multi-tildes in the aim to provide double multitilde operators for regular languages. We show that the underlying algebraic structure involves the action of some operads. An operad is an algebraic structure that mimics the composition of the functions. The involved operads are described in terms of combinatorial objects. These operads are obtained from more pri...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملSynchronized Shuue and Regular Languages Synchronized Shuue and Regular Languages
New representation results for three families of regular languages are stated, using a special kind of shuue operation, namely the synchronized shuue. First, it is proved that the family of regular star languages is the smallest family containing the language (a + bc) and closed under synchronized shuue and length preserving morphism. The second representation result states that the family of "...
متن کاملRegular patterns, regular languages and context-free languages
In this paper we consider two questions. First we consider whether every pattern language which is regular can be generated by a regular pattern. We show that this is indeed the case for extended (erasing) pattern languages if alphabet size is at least four. In all other cases, we show that there are patterns generating a regular language which cannot be generated by a regular pattern. Next we ...
متن کاملCo-Regular Languages and Uni cation of Co-Regular Languages
The main goal of this work is the investigation of some properties of co-regular languages. In many applications it is important to handle innnite sets of terms. We represent two equivalent formalisms for nite deened innnite sets of term substitutions which are leading to co-regular languages. As it will be proved later the co-regular languages are monoidic homomorphical images of regular langu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2016
ISSN: 0196-8858
DOI: 10.1016/j.aam.2016.01.002