Open AccessBook
Regulated rewriting in formal language theory
Jrgen Dassow,Gheorghe Paun +1 more
TLDR
This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies, as well as selective substitution grammars as one common generalization.Abstract:
It is well-known that context-free grammars cannot cover all aspects of natural languages, progamming languages and other related fields. Therefore a lot of mechanisms have been introduced which control the application of context-free rules. This book presents 25 different regulating mechanisms by definitions, examples and basic facts, especially concerning hierarchies. Matrix, programmed, and random context grammars as typical representants are studied in more detail. Besides their algebraic and decidability properties a comparison is made with respect to syntactic complexity measures and pure versions. Further topics are combinations of some control mechanisms, regulated L systems, automata characterizations, Szilard languages, and grammar forms of regulated grammars as well as selective substitution grammars as one common generalization.read more
Citations
More filters
Journal ArticleDOI
Computing with Membranes
TL;DR: It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.
Journal ArticleDOI
Tissue P systems
TL;DR: A computing model called a tissue P system is proposed, which processes symbols in a multiset rewriting sense, in a net of cells, which can simulate a Turing machine even when using a small number of cells.
Book ChapterDOI
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
TL;DR: This book investigates two major systems, cooperating distributed grammar systems and parallel communicating grammar systems, which concerns hierarchies with respect to different variants of cooperation, relations with classical formal language theory, syntactic parameters such as the number of components and their size, power of synchronization, and general notions generated from artificial intelligence.
Journal ArticleDOI
A guide to membrane computing
Gheorghe Paun,Grzegorz Rozenberg +1 more
TL;DR: The present paper presents the basic ideas of computing with membranes and some fundamental properties (mostly concerning the computational power and efficiency) of P systems of various types.
Journal ArticleDOI
The power of communication: P systems with symport/antiport
Andrei Păun,Gheorghe Paun +1 more
TL;DR: Interestingly enough, membrane systems without changing (evolving) the used objects and with the communication based on rules of this type are computationally complete, and this result is achieved even for pairs of communicated objects.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Journal ArticleDOI
On Context-Free Languages
TL;DR: In this report, certain properties of context-free (CF or type 2) Grammars are investigated, like that of Chomsky, and it is shown that this type of grammar is essentially stronger than type 2 grammars and has the advantage over type 1 grammARS that the phrase structure of a grammatical sentence is unique, once the derivation is given.
Journal ArticleDOI
Remarks on blind and partially blind one-way multicounter machines
TL;DR: This work considers one-way nondeterministic machines which have counters allowed to hold positive or negative integers and which accept by final state with all counters zero and quasirealtime partially blind multicounter machines.