On The Computational Complexity of Marcus Contextual Languages

Authors:
Lucian Ilie
Affiliations:
(Research supported by the Academy of Finland, Project 137358) (On leave of absence from Faculty of Mathematics, University of Bucharest, Str. Academiei 14, R-70109, Bucharest, Romania) Turku Cent ...
Venue:
Fundamenta Informaticae
Year:
1997

Citing 6
Cited 1

Formal languages

Formal languages
Normal forms for contextual grammars

Mathematical aspects of natural and formal languages
Marcus contextual grammars: modularity and leftmost derivation

Mathematical aspects of natural and formal languages
On computational complexity of contextual languages

Theoretical Computer Science - Special issue: formal language theory
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
CONTEXTUAL GRAMMARS: PARALLELISM AND BLOCKING OF DERIVATION

Fundamenta Informaticae

An Efficient Parser for a Class of Contextual Languages

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the computational complexity of the basic type of contextual languages, that is, the ones introduced by Marcus and called subsequently external contextual languages. We prove that the family of languages generated by external contextual grammars with context-free selection contains only polynomial time parsable languages.