Terminal Context in Context-Sensitive Grammars

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1972 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 1, pages 20-30 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Ronald V. Book;

doi: 10.1137/0201003

Terminal Context in Context-Sensitive Grammars

- Summary
- Subjects
- Metrics

Abstract

If every non-context-free rewriting rule of a context-sensitive (with erasing) grammar has as left context a string of terminal symbols and the left context is at least as long as the right context, then the language generated is context-free. If every non-context-free rewriting rule of a context-sensitive (with erasing) grammar has as left and right context strings of terminal symbols, then the language generated is context-free.

Related Organizations

Harvard University
United States

Keywords

Formal languages and automata

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	13
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average