Detecting Useless Transitions in Pushdown Automata

Abstract

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Detecting useless transitions in pushdown automata

“…An earlier version of this paper appeared as [3]. In comparison to that paper, the current paper contains the correctness proofs of our algorithm, discusses the alternative algorithms based on post * and pre * in depth, and presents a more thorough experimental comparison of the algorithms.…”