Sciweavers

MFCS
2007
Springer
15 years 10 months ago
Minimizing Variants of Visibly Pushdown Automata
The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses of VPA are introduced: call driven automata, and block automata. For the first class, minim...
Patrick Chervet, Igor Walukiewicz