612 search results - page 30 / 123 » A Computational Grammar for Georgian |
108
click to vote
TCS
2008
15 years 1 months ago
2008
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
103
click to vote
CALCO
2009
Springer
15 years 8 months ago
2009
Springer
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
102
click to vote
VL
2005
IEEE
15 years 7 months ago
2005
IEEE
Structured program editors can lower the entry barrier for beginning computer science students by preventing syntax errors. However, when editors force programs to be executable a...
105
click to vote
OOPSLA
2005
Springer
15 years 7 months ago
2005
Springer
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...
DLT
2010
15 years 2 months ago
2010
Abstract. The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer a...