NTS languages are deterministic and congruential
- 2 December 1985
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 31 (3) , 332-342
- https://doi.org/10.1016/0022-0000(85)90056-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- NTS grammars and church–rosser systemsInformation Processing Letters, 1981
- The equivalence problem for real-time strict deterministic languagesInformation and Control, 1980
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- Une Generalisation des Ensembles de DyckIsrael Journal of Mathematics, 1971
- Parenthesis GrammarsJournal of the ACM, 1967