scientific article; zbMATH DE number 3430632
From MaRDI portal
zbMath0274.02012MaRDI QIDQ5181346
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Polynomial-time identification of very simple grammars from positive data., The equivalence and inclusion problems for NTS languages, NTS languages are deterministic and congruential, A polynomial algorithm testing partial confluence of basic semi-Thue systems, Some decision problems about controlled rewriting systems, Some remarks on the KH algorithm fors-grammars, A characterisation of deterministic context-free languages by means of right-congruences, Unnamed Item, A polynomial algorithm testing partial confluence of basic semi-Thue systems, Homomorphic images of sentential form languages defined by semi-Thue systems
