Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width

We present a novel fixed-point algorithm to solve reachability of multi-stack pushdown systems restricted to runs of bounded-scope. The followed approach is compositional, in the sense that the runs of the system are summarized by bounded-size interfaces. Moreover, it is suitable for a direct implementation and can be exploited to prove two new results. We give a sequentialization for this class of systems, i.e., for each such multi-stack pushdown system we construct an equivalent single-stack pushdown system that faithfully simulates the behaviour of each thread. We prove that the behaviour graphs (multiply nested words) for these systems have bounded three-width, and thus a number of decidability results can be derived from Courcelle’s theorem

Relativity of representations in quantum mechanics

Only the position representation is used in introductory quantum mechanics and the momentum representation is not usually presented until advanced undergraduate courses. To emphasize the relativity of the representations of the abstract formulation of quantum mechanics, two examples of representations related to the operators aX+(1-a)P and (XP+PX)/2 are presented.Comment: 10 pages, no figures, accepted in Am.J.Phy