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

Information Processing Letters - Netherlands
doi 10.1016/0020-0190(82)90016-3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

On the Equivalence and Containment Problems for Context-Free Languages

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1969English

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 Complexity of Parallel Parsing of General Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1986English

A Note on Sufficiency in Coherent Models

International Journal of Mathematics and Mathematical Sciences
Mathematics
1981English

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

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

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2014English

On a Solving of Algebraic Equations Systems Associated With Context-Free Languages

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy