3440 search results - page 9 / 688 » Logics For Context-Free Languages |
BIOCOMP
2008
14 years 11 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...
ACL
1992
14 years 11 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...
ACL
2008
14 years 11 months ago
2008
We take a multi-pass approach to machine translation decoding when using synchronous context-free grammars as the translation model and n-gram language models: the first pass uses...
LICS
1993
IEEE
15 years 1 months ago
1993
IEEE
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free.
ECML
2003
Springer
15 years 3 months ago
2003
Springer
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...