268 search results - page 10 / 54 » Linear Context Free Languages |
FCCM
2000
IEEE
13 years 11 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
14 years 17 days 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...
COLING
2008
13 years 8 months ago
2008
We generalize Uno and Yagiura's algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the tw...
BIOCOMP
2008
13 years 8 months ago
2008
A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequences. In terms of the theory of symbolic dynamics, neither of the Dyck shift nor the Motzki...
STACS
2004
Springer
14 years 21 days 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 ...