Sciweavers

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

29

LACL
2001
Springer

favoriteEmaildiscussreport

97views Automated Reasoning» more LACL 2001»

Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars

14 years 3 months ago

Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars

Download esslli2009.labri.fr

Jens Michaelis

Real-time Traffic

Automated Reasoning | LACL 2001 |

claim paper

Related Content

» Optimal Parsing Strategies for Linear ContextFree Rewriting Systems

» Efficient Parsing of WellNested Linear ContextFree Rewriting Systems

» Linear ContextFree Rewriting Systems and Deterministic TreeWalking Transducers

» Recognition of Linear ContextFree Rewriting Systems

» Optimal Rank Reduction for Linear ContextFree Rewriting Systems with FanOut Two

» DataDriven Parsing with Probabilistic Linear ContextFree Rewriting Systems

» Generalized Multitext Grammars

» Recognizing Plans with Loops Represented in a Lexicalized Grammar

» A Note on the Complexity of Constraint Interaction Locality Conditions and Minimalist Gram...

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	LACL
Authors	Jens Michaelis

Comments (0)