The Membership Question for ET0L-Languages is Polynomially Complete

Jan van Leeuwen. The Membership Question for ET0L-Languages is Polynomially Complete. Inf. Process. Lett., 3(5):138-143, 1975.

Abstract

Abstract is missing.