"The Membership Question for ET0L-Languages is Polynomially Complete."

Jan van Leeuwen (1975)

Details and statistics

DOI: 10.1016/0020-0190(75)90027-7

access: closed

type: Journal Article

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics