The unsolvability of the equality problem for sentential forms of context-free grammars

DOI10.1016/S0022-0000(73)80002-9zbMath0273.68054MaRDI QIDQ2264550

Meera Blattner

Publication date: 1973

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

On equality of multiplicity sets of regular languages ⋮ 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 ⋮ PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT† ⋮ Wave functions relative to a real polarization ⋮ On the decidability of the sequence equivalence problem for DOL-systems ⋮ Classes of formal grammars ⋮ Bounds in the propagation of selection into logic programs ⋮ Some decidability problems of sentential formst † ⋮ Characterization of unary developmental languages

Cites Work

• Unnamed Item
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• A note on some systems of lindenmayer
• On 0L-Languages