Controllability of structured polynomial systems

Two algorithms, based on the Grobner basis method, which facilitate the con trollability analysis for a class of polynomial systems are presented. The authors combine these algorithms with some recent results on output dead-be at controllability in order to obtain sufficient, as well as necessary, con ditions for complete and state dead-beat controllability for a surprisingly large class of polynomial systems. Our results are generically applicable to the class of polynomial systems in strict feedback form.