Regulated Rewriting in Formal Language Theory

@inproceedings{Dassow1989RegulatedRI,
  title={Regulated Rewriting in Formal Language Theory},
  author={J{\"u}rgen Dassow and Gheorghe Paun},
  year={1989}
}
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… 
Regulated Grammars and Automata : The Gist with a Case Study (New contact points of algebraic systems, logics, languages, and computer sciences)
TLDR
It is pointed out that propagating versions of one-sided random-context grammars characterize the family of context-sensitive languages, and with erasing rules, they characterize theFamily of recursively enumerable languages; as a result, they are stronger than ordinary random context Grammars.
On restricted context-free grammars
Boolean Grammars
  • A. Okhotin
  • Computer Science
    Developments in Language Theory
  • 2003
TLDR
A new class of formal grammars, which allow the use of all set-theoretic operations as an integral part of the formalism of rules, are introduced, which allows to conjecture the practical applicability of the new concept.
New Grammar Systems and Their Application Perspectives
TLDR
The paper recalls formal definitions of the systems and discusses theoretical results regarding their generative and accepting power, and briefly introduces application perspectives in natural language translation, illustrated by examples of Czech-English translation.
Context-Free Grammars with Linked Nonterminals
TLDR
A new type of finite copying parallel rewriting system, i.
Graphs of Grammars – Derivations as Parallel Processes
TLDR
The concepts of the graph of generative grammars and Lindenmayer systems are investigated; these special and-or graphs represent all information about the grammar and can effectively be used to follow derivations.
Graph-Controlled Grammars as Language Acceptors
  • H. Fernau
  • Computer Science
    J. Autom. Lang. Comb.
  • 1997
TLDR
periodically time-variant grammars yield the rst example of a non-trivial equivalence of generating and accepting mode in the absence of appearance checkings.
Programmed grammars and their relation to the LBA problem
TLDR
This paper considers generating and accepting programmed grammars with bounded degree of non-regulation with maximum number of elements in success or in failure fields of the underlying grammar to shed new light on some longstanding open problem in the theory of computational complexity.
Parsing based on n-path tree - controlled grammars
This paper discusses recently introduced kind of linguistically motivated restriction placed on tree-controlled grammars-context-free grammars with some root-to-leaf paths in their derivation trees
Accepting Pure Grammars and Systems
TLDR
This work considers several types of pure grammars and systems as language acceptors and compares them to their generating counterparts, and considers several concepts of determinism of Linden-mayer systems both in generating and in accepting case.
...
1
2
3
4
5
...

References

SHOWING 1-5 OF 5 REFERENCES
On Context-Free Languages
TLDR
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.
Introduction to Automata Theory, Languages and Computation
Petri nets: Properties, analysis and applications
TLDR
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.
Remarks on Blind and Partially Blind One-Way Multicounter Machines
Introduction to the theory of computation