3440 search results - page 11 / 688 » Logics For Context-Free Languages |
JALC
2006
14 years 9 months ago
2006
-- Let {a1, a2, . . . , an} be an alphabet of n symbols and let Cn be the language of circular shifts of the word a1a2
112
click to vote
CONCUR
2008
Springer
14 years 11 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
ANLP
2000
14 years 11 months ago
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
AAAI
1997
14 years 11 months ago
1997
We describe a parsing system based upon a language model for English that is, in turn, based upon assigning probabilities to possible parses for a sentence. This model is used in ...
ACL
2010
14 years 7 months ago
2010
The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important i...