1242 search results - page 47 / 249 » The Theory of Grammar Constraints |
184
click to vote
CDC
2008
IEEE
16 years 18 days ago
2008
IEEE
Abstract. Differential repetitive processes are a distinct class of continuous-discrete twodimensional linear systems of both systems theoretic and applications interest. These pr...
148
click to vote
AISC
2004
Springer
15 years 11 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
154
click to vote
LATA
2010
Springer
16 years 28 days ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
194
click to vote
AIIA
1995
Springer
15 years 9 months ago
1995
Springer
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
152
click to vote
DLS
2008
15 years 7 months ago
2008
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...