Generalized local adjunction and replacement in adjunct languages
Generalized local adjunction and replacement in adjunct languages
Formal languages and their relation to automata
Formal languages and their relation to automata
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Finite automata and their decision problems
IBM Journal of Research and Development
A characterization of context-free languages
Journal of Computer and System Sciences
| Hi-index | 14.98 |
The local adjunct languages (LAL's) and grammars have been defined so as to characterize many aspects of natural and programming languages.