Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems

DOI10.1016/0020-0190(72)90018-XzbMATH Open0249.68029MaRDI QIDQ2556750FDOQ2556750

Authors: Grzegorz Rozenberg 

Publication date: 1972

Published in: Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The equivalence problem for deterministic TOL-systems is undecidable
• On 0L-Languages

Cited In (5)

• On equality of multiplicity sets of regular languages
• Some decidability problems of sentential formst †
• Grammars with valuations - a discrete model for self-organization of biopolymers
• The decidability of the DOL-DTOL equivalence problem
• Description of developmental languages using recurrence systems

This page was built for publication: Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556750)