"P-hardness of the emptiness problem for visibly pushdown languages."

Martin Lange (2011)

Details and statistics

DOI: 10.1016/J.IPL.2010.12.013

access: closed

type: Journal Article

metadata version: 2018-01-09

a service of  Schloss Dagstuhl - Leibniz Center for Informatics