3440 search results - page 8 / 688 » Logics For Context-Free Languages |
DLT
2009
14 years 7 months ago
2009
Abstract. We consider algorithms for approximating context
103
click to vote
ACL
1992
14 years 11 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...
FCCM
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents an FPGA-based implementation of a co-processing unit able to parse context-free grammars of real-life sizes. The application elds of such a parser range from p...
ECML
2003
Springer
15 years 3 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
STACS
2004
Springer
15 years 3 months ago
2004
Springer
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...