A Strong Pumping Lemma for Context-Free Languages
Loading...
Files
Other Version
Theoretical Computer Science 3, 3 (1976) 359--369
External File or Record
Can’t use the file because of accessibility barriers? Contact us
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Permanent Link
Abstract
Series and Number:
Indiana University Computer Science Technical Reports; TR4
EducationalLevel:
Is Based On:
Target Name:
Teaches:
Table of Contents
Description
Keywords
Citation
Journal
DOI
Rights
This work is protected by copyright unless stated otherwise.