Journal of Shanghai Jiaotong University ›› 2015, Vol. 49 ›› Issue (08): 1084-1089.

• Automation Technique, Computer Technology • Previous Articles     Next Articles

Expressiveness of WellStructured Pushdown Systems

JIN Yang,CAI Xiaojuan,LI Guoqiang   

  1. (BASICS Laboratory, Shanghai Jiaotong University, Shanghai 200240, China)
  • Received:2014-10-28 Online:2015-08-31 Published:2015-08-31

Abstract:

Abstract: A well-structured pushdown system(WSPDS) is a pushdown system equipped with well-quasi-order states and a well-quasi-order stack alphabet. It is shown that several extensions of vector addition systems can be reduced to a WSPDS. By applying post-order calculation of its derivation tree, the branching vector addition system can be encoded to some WSPDS. The recursive vector addtion system is a special class of WSPDS if a stack is explicitly introduced to its transitions. The vector addtion system with one zero-test can be encoded to some WSPDS where the depth of the stack represents the dimension for zerotest. These results exhibit the powerful expressivenss of WSPDS.

Key words: well-structured pushdown system, well-quasi-order, vector addition system, reachability problem

CLC Number: