On finite grammar forms
- 1 January 1983
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 12 (3), 227-240
- https://doi.org/10.1080/00207168208803340
Abstract
This paper discusses finite grammar forms. In particular, results concerning successor and nonsuccessor families, as well as normal form (with respect to minimality) results are obtained. Interconnections with recent work concerning graph families are also pointed out.Keywords
This publication has 7 references indexed in Scilit:
- Dense Hierarchies of Grammatical FamiliesJournal of the ACM, 1982
- Colorings and interpretations: a connection between graphs and grammar formsDiscrete Applied Mathematics, 1981
- MSW spacesInformation and Control, 1980
- Context-free grammar forms with strict interpretationsJournal of Computer and System Sciences, 1980
- On generators and generative capacity of EOL formsActa Informatica, 1980
- Grammar and L forms: An introductionLecture Notes in Computer Science, 1980
- On strongly equivalent context-free grammar formsComputing, 1976