Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

JALC
2007

favoriteEmaildiscussreport

84views more JALC 2007»

Enumeration of Context-Free Languages and Related Structures

13 years 10 months ago

Enumeration of Context-Free Languages and Related Structures

Download www.cs.umanitoba.ca

In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate that the exact quantity of context-free languages of size ¢ is uncomputable. Nevertheless, we are able to give upper and lower bounds on the number of such languages. We also generalize our results to enumerate predicates that are recursively enumerable or co-recursively enumerable.

Michael Domaratzki, Alexander Okhotin, Jeffrey Sha

Real-time Traffic

Context-free Grammars | Context-free Languages | JALC 2007 | Reasonable Descriptional Complexity |

claim paper

Related Content

» Simple Functional Sound and Complete Parsing for All ContextFree Grammars

» The Structure of Shared Forests in Ambiguous Parsing

» Equivalence Relations on Classes of Computable Structures

» Eliciting hierarchical structures from enumerative structures for ontology learning

» Predicting Location and Structure Of betaSheet Regions Using Stochastic Tree Grammars

» Accurate Unlexicalized Parsing for Modern Hebrew

» Search for a New Description of Protein Topology and Local Structure

» GoldStyle and Query Learning Under Various Constraints on the Target Class

» Software engineering and the Internet a roadmap

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JALC
Authors	Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit

Comments (0)