A lower-bound for the number of productions required for a certain class of languages
Authors:
- Brian AlspachBABrian Alspach
- 1 July 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 6 (2) , 109-115
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Context-free complexity of finite languagesTheoretical Computer Science, 1983
- Concise description of finite languagesTheoretical Computer Science, 1981