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

This paper introduces scattered context grammars without erasing productions, in which an application of a production always occurs within the first n nonterminals of the current sentential form. It demonstrates that this restriction gives rise to an infinite hierarchy of language families each of w...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 410; no. 21; pp. 1961 - 1969
Main Authors: Meduna, Alexander, Techet, Jiří
Format: Journal Article
Language:English
Published: Oxford Elsevier B.V 17.05.2009
Elsevier
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Generative power
Global analysis, analysis on manifolds
Infinite hierarchy of language families
Left derivation restriction
Logic and foundations
Mathematical logic, foundations, set theory
Mathematics
Miscellaneous
Recursion theory
Scattered context grammars
Sciences and techniques of general use
Theoretical computing
Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds
Unordered scattered context grammars
Generative power
Infinite hierarchy of language families
Left derivation restriction
Scattered context grammars
Unordered scattered context grammars
Addition
Context sensitive language
Computer theory
Language family
Grammar
Language hierarchy
Production
Application
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper introduces scattered context grammars without erasing productions, in which an application of a production always occurs within the first n nonterminals of the current sentential form. It demonstrates that this restriction gives rise to an infinite hierarchy of language families each of which is properly included in the family of context-sensitive languages. In addition, it proves analogous results for unordered scattered context grammars. Some consequences of these results are derived and open problems formulated.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2008.12.013