Accepting Grammars and Systems: An Overview.

@inproceedings{Bordihn1995AcceptingGA,
  title={Accepting Grammars and Systems: An Overview.},
  author={Henning Bordihn and Henning Fernau},
  booktitle={Developments in Language Theory},
  year={1995}
}
We investigate several kinds of regulated rewriting (matrix, ordered, programmed, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In a lot of cases, accepting mode turns out to be exactly as powerful as generating mode. These equivalences can be proved using a theorem on so-called context condition… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 26 references

On Extended k-uniformly-limited T0L Systems and Languages

Elektronische Informationsverarbeitung und Kybernetik • 1990
View 4 Excerpts
Highly Influenced

Accepting grammars with regulation

H. Bordihn, H. Fernau
International Journal of Computer Mathematics, 53:1{18 • 1994
View 5 Excerpts
Highly Influenced

A Weak Iteration Theorem for k-limited E0L Systems

Elektronische Informationsverarbeitung und Kybernetik • 1992
View 3 Excerpts
Highly Influenced

Formal languages

Computer science classics • 1987
View 4 Excerpts
Highly Influenced

Membership for k-Limited ET0L Languages is not Decidable

Journal of Automata, Languages and Combinatorics • 1994

On Function-limited Lindenmayer Systems

Elektronische Informationsverarbeitung und Kybernetik • 1991
View 1 Excerpt

Similar Papers

Loading similar papers…