The Inclusion Problem of Context-Free Languages: Some Tractable Cases

International Journal of Foundations of Computer Science - Singapore
doi 10.1142/s0129054111008040
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

The Inclusion Problem for Some Subclasses of Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2000English

Regular Description of Context-Free Graph Languages

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1996English

Generation of Formatters for Context-Free Languages

ACM Transactions on Software Engineering and Methodology
Software
1996English

Topological Properties of Omega Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2001English

On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1998English

Inverse Monoids, Trees and Context-Free Languages

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1993English

On the Complexity of Parallel Parsing of General Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1986English

On the Equivalence and Containment Problems for Context-Free Languages

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1969English

The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy