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

Theory of Computing Systems - United States
doi 10.1007/s00224-014-9534-z
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Generation of Formatters for Context-Free Languages

ACM Transactions on Software Engineering and Methodology
Software
1996English

The Inclusion Problem for Some Subclasses of Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2000English

On the Equivalence and Containment Problems for Context-Free Languages

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1969English

A Note on the Sufficiency of Sokolowski's Criterion for Context-Free Languages

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1982English

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

International Journal of Foundations of Computer Science
Computer Science
2011English

Regular Description of Context-Free Graph Languages

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

Topological Properties of Omega Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2001English

Computation of Distances for Regular and Context-Free Probabilistic Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2008English

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

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1986English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy