Computation of Distances for Regular and Context-Free Probabilistic Languages

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2008.01.010
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Regular Description of Context-Free Graph Languages

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

Computing Maximal Error-Detecting Capabilities and Distances of Regular Languages

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2010English

Probabilistic Context Free Grammar for Urdu

Linguistics and Literature Review
2016English

Generation of Formatters for Context-Free Languages

ACM Transactions on Software Engineering and Methodology
Software
1996English

Inverse Monoids, Trees and Context-Free Languages

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1993English

Topological Properties of Omega Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2001English

On the Equivalence and Containment Problems for Context-Free Languages

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1969English

The Inclusion Problem for Some Subclasses of Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2000English

Generalized Queries on Probabilistic Context-Free Grammars

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy