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

DOI10.1016/S0022-0000(73)80002-9MaRDI QIDQ2264550zbMATH OpenFDO

Authors Meera Blattner

Publication date 1973

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

Full work available at URL https://doi.org/10.1016/S0022-0000(73)80002-9

Mathematics Subject Classification ID

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

Cites work

• A note on some systems of lindenmayer
• scientific article; zbMATH DE number 3174044 (Why is no real title available?)
• On 0L-Languages
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Cited in

(11)

• 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
• 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
• Characterization of unary developmental languages
• Description of developmental languages using recurrence systems
• PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†
• Some decidability problems of sentential formst †

This page was built for publication: The unsolvability of the equality problem for sentential forms of context-free grammars

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