Context-free complexity of finite languages
Authors:
- 1 January 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 28 (3) , 277-285
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A note on a problem in the theory of grammatical complexityTheoretical Computer Science, 1981
- Concise description of finite languagesTheoretical Computer Science, 1981