Sciweavers

Share
LATA
2010
Springer

Pregroup Grammars with Letter Promotions

11 years 1 months ago
Pregroup Grammars with Letter Promotions
We study pregroup grammars with letter promotions p(m) q(n) . We show that the Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p(n)
Wojciech Buszkowski, Zhe Lin
Added 02 Mar 2010
Updated 02 Mar 2010
Type Conference
Year 2010
Where LATA
Authors Wojciech Buszkowski, Zhe Lin
Comments (0)
books