Scattered context grammars

Authors:
Sheila Greibach;John Hopcroft
Affiliations:
Air Force Cambridge Research Laboratories, Office of Aerospace Research, USAF, Bedford, Massachusetts, USA and Air Force Office of Scientific Research, Office of Aerospace Research, USAF, Arlingto ...;Air Force Cambridge Research Laboratories, Office of Aerospace Research, USAF, Bedford, Massachusetts, USA and Air Force Office of Scientific Research, Office of Aerospace Research, USAF, Arlingto ...
Venue:
Journal of Computer and System Sciences
Year:
1969

Citing 1
Cited 16

One-way stack automata

Journal of the ACM (JACM)

Multiset Automata

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Quasi-realtime languages (Extended Abstract)

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Canonical scattered context generators of sentences with their parses

Theoretical Computer Science
Note: On the descriptional complexity of scattered context grammars

Theoretical Computer Science
An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations

Theoretical Computer Science
An hierarchy between context-free and context-sensitive languages

Journal of Computer and System Sciences
Absolutely parallel grammars and two-way finite-state transducers

Journal of Computer and System Sciences
Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals

Fundamenta Informaticae
Scattered context grammars generate any recursively enumerable language with two nonterminals

Information Processing Letters
Simple restriction in context-free rewriting

Journal of Computer and System Sciences
Formal modeling by a bi-parallel grammar

MMACTEE'06 Proceedings of the 8th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete

Journal of Logic, Language and Information
On Descriptional Complexity of Partially Parallel Grammars

Fundamenta Informaticae
On Using Semi-Dyck Sets To Analyse Coupled-Context-Free Languages

Fundamenta Informaticae
Maximal and minimal scattered context rewriting

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A note on scattered context grammars

Information Processing Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

Scattered context grammars are defined and the closure properties of the family of languages generated are considered. This family of languages is contained in the family of context sensitive languages and contains all languages accepted by linear time nondeterministic Turing machines.