Sciweavers

MFCS
2009
Springer
15 years 3 months ago
Synchronization of Regular Automata
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...
Didier Caucal