Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems
- 31 December 1972
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 1 (6), 233-235
- https://doi.org/10.1016/0020-0190(72)90018-x
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The equivalence problem for deterministic T0L-systems is undecidableInformation Processing Letters, 1972
- On 0L-LanguagesInformation and Control, 1971
- Mathematical models for cellular interactions in development I. Filaments with one-sided inputsJournal of Theoretical Biology, 1968