The unsolvability of the equality problem for sentential forms of context-free grammars. (English) Zbl 0273.68054


68Q45 Formal languages and automata
03D05 Automata and formal grammars in connection with logical questions
Full Text: DOI


[1] Lindenmayer, A., Mathematical models for cellular interaction in development I, II, J. theoret. biol., 18, 280-315, (1968)
[2] Lindenmayer, A., Developmental systems without interactions, their languages and grammars, J. theoret. biol., 30, 455-484, (1971)
[3] Herman, G.T., The computing ability of a developmental model for filamentous organisms, J. theoret. biol., 25, 421-435, (1969)
[4] van Dalen, D., A note on some systems of lindenmayer, Math. systems theory, 5, 128-140, (1971) · Zbl 0218.02031
[5] Rozenberg, G.; Doucet, P.G., On OL-languages, Information and control, 19, 302-318, (1971) · Zbl 0242.68052
[6] Bar-Hillel, Y.; Perles, M.; Shamir, E., On formal properties of simple phrasestructure grammars, Z. phonetik, sprachwiss, kommunikat., 14, 143-172, (1961) · Zbl 0106.34501
[7] Griffiths, T.V., The unsolvability of the equivalence problem for λ-free nondeterministic generalized machines, J. assoc. comput. Mach., 15, 409-413, (1968) · Zbl 0162.02302
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.