105
click to vote
MFCS
2009
Springer
15 years 9 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...