"The emptiness problem for indexed language is exponential-time complete."

Shinichi Tanaka, Takumi Kasai (1986)

Details and statistics

DOI: 10.1002/SCJ.4690170904

access: closed

type: Journal Article

metadata version: 2023-09-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics