268 search results - page 1 / 54 » Linear Context Free Languages |
110
click to vote
ICTAC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this paper, I present the class of linear context free languages (LCFLs) with a class of non-deterministic one-way two-head (read only) automata, called non-determinis...
94
Voted
ACL
1992
15 years 1 months ago
1992
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
84
Voted
CAI
2007
Springer
15 years 6 months ago
2007
Springer
121
Voted
ACL
1992
15 years 1 months ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
102
Voted
NAACL
2010
14 years 10 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...