Defining Languages by Forbidding-Enforcing Systems

نویسنده

  • Daniela Genova
چکیده

Motivated by biomolecular computing, forbidding-enforcing systems (fe-systems) were first used to define classes of languages (fefamilies) based on boundary conditions. This paper presents a new model of fe-systems in which fe-systems define single languages (fe-languages) based on forbidden and enforced subwords. The paper characterizes wellknown languages by fe-systems, investigates the relationship between fefamilies and fe-languages, and describes how an fe-system can generate the solution to the k-colorability problem and model splicing.

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

ثبت نام

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

منابع مشابه

Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems

This paper investigates ways to reduce redundancy in forbidding sets for language forbidding-enforcing systems. A language forbidding set disallows combinations of subwords in a word, while permitting the presence of some parts of these combinations. Since a forbidding set is a potentially infinite set of finite sets of words, finding normal forms for forbidding sets is interesting from a combi...

متن کامل

Topological Properties of Forbidding-Enforcing Systems

Forbidding-enforcing systems (fe-systems) define classes of languages (fe-families) based on boundary conditions. We characterize f -families having not necessarily finite forbidders and prove that none of the Chomsky families of languages can be defined with an fe-system, hence, fe-systems provide a completely new way of defining classes of languages. We show that f -families map to f -familie...

متن کامل

Research Summary

Inspired by biomolecular reactions and processes Rozenberg and Ehrenfeucht define forbidding and enforcing systems (fe-systems) on languages and study their language theoretical and computational properties (see [8–10, 41]). The general idea of the forbidding-enforcing paradigm is that a class of structures is defined by a pair of constraints, called an fe-system. In their model, an fe-system d...

متن کامل

Defining structures through forbidding and enforcing constraints

This paper introduces a new way of modeling classes of physical and biochemical processes and structures based on boundary conditions that are called ‘‘forbidden’’ and ‘‘enforced’’. The model of forbidding–enforcing systems (fe-systems) is presented in a general categorical sense and we use three specific examples of categories to illustrate three different phenomena. The hydrogen and covalent ...

متن کامل

Generating Classes of Languages by P Systems and Other Devices

The purpose of this paper is to give a finite description of the classes of languages (as opposed to the description of languages) by a generative device, like a P system. The definition of the generated class is inspired by the forbidding-enforcing systems. A more general definition of generating a class of languages by two devices is also given and some relationships between these two definit...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

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