Parallelism in Contextual Grammars

Authors:
Victor Mitrana
Affiliations:
Department of Mathematics, University of Bucharest, Bucharest, Romania. mitrana@moisil.math.ro
Venue:
Fundamenta Informaticae
Year:
1998

Citing 7
Cited 0

Formal languages

Formal languages
The computational linguistics of biological sequences

Artificial intelligence and molecular biology
Contextual grammars: the strategy of minimal competence

Mathematical aspects of natural and formal languages
Contextual grammars: parallelism and blocking of derivation

Fundamenta Informaticae - Special issue on formal language theory
Contextual grammars and formal languages

Handbook of formal languages, vol. 2
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
On two recent attempts to show that English is not a CFL

Computational Linguistics - Special issue on mathematical properties of grammatical formalisms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two strategies of parallel adjoining of contexts are considered for contextual grammars with choice. After a short comparison between them, there are provided Chomsky-Schutzenberger type characterizations of context-free and recursively enumerable languages. Finally, we discuss some decision problems.