FSTTCS
2008
Springer
13 years 5 months ago
2008
Springer
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...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...