268 search results - page 3 / 54 » Linear Context Free Languages |
ESOP
2009
Springer
14 years 26 days ago
2009
Springer
ICALP
1993
Springer
13 years 10 months ago
1993
Springer
DLT
2001
13 years 7 months ago
2001
Context-free valence languages (over Zk ) are shown to be codings of the intersection of a context-free language and a blind kcounter language. This afl-style characterization all...
ACL
2010
13 years 4 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
ICGI
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...