Sciweavers

67
Voted
FSTTCS
2008
Springer
15 years 5 days ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal