Sciweavers

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

19

DLT
2009

favoriteEmaildiscussreport

116views Theoretical Computer Science» more DLT 2009»

Strongly Regular Grammars and Regular Approximation of Context-Free Languages

13 years 2 months ago

Strongly Regular Grammars and Regular Approximation of Context-Free Languages

Download www.cs.ucsb.edu

Abstract. We consider algorithms for approximating context

Ömer Egecioglu

Real-time Traffic

DLT 2009 | Grammar | Regular | Regular Grammars | Theoretical Computer Science |

claim paper

Related Content

» XML Validation for ContextFree Grammars

» Analyzing Ambiguity of ContextFree Grammars

» Linear ContextFree Rewriting Systems and Deterministic TreeWalking Transducers

» Distributional Learning of Some ContextFree Languages with a Minimally Adequate Teacher

» Active ContextFree Games

» LeftToRight Parsing and Bilexical ContextFree Grammars

» Complexity Results on Balanced ContextFree Languages

» Restricted Global Grammar Constraints

» Using Contextual Representations to Efficiently Learn ContextFree Languages

Post Info
More Details (n/a)

Added	17 Feb 2011
Updated	17 Feb 2011
Type	Journal
Year	2009
Where	DLT
Authors	Ömer Egecioglu

Comments (0)