×

zbMATH — the first resource for mathematics

Description of developmental languages using recurrence systems. (English) Zbl 0313.68068

MSC:
68Q45 Formal languages and automata
Software:
ALGOL 60
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] M. Blattner, The unsolvability of the equality problem for sentential forms of contextfree languages,J. Computer System Sciences 7 (1973), 463–468. · Zbl 0273.68054
[2] A. Ehrenfeucht andG. Rozenberg, The equality of EOL languages and codings of OL languages,Internat. J. Computer Math., to appear. · Zbl 0314.68027
[3] R. W. Floyd, On the nonexistence of a phrase structure grammar for algol 60,Comm. ACM 5 (1962), 483–484. · Zbl 0112.35805
[4] S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966. · Zbl 0184.28401
[5] S. Ginsburg andH. G. Rice, Two families of languages related to algol,J. ACM 9 (1962), 350–371. · Zbl 0196.01803
[6] G. T. Herman, Closure properties of some families of languages associated with biological systems,Information and Control,24 (1974), 101–121. · Zbl 0275.68018
[7] G. T. Herman, A biologically motivated extension of algol-like languages,Information and Control 22 (1973), 487–502. · Zbl 0257.68009
[8] P. Hogeweg andB. Hesper, Pattern recognition in biology: A methodical analysis using computer experimentation,IV Int. Congress Logic, Methodology, Philosophy of Science (1971), Abstract, 279–280.
[9] J. E. Hopcroft andJ. D. Ullman,Formal languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969. · Zbl 0196.01701
[10] E. Konrad-Hawkins, Developmental studies of regenerates ofCallithamnion reseum Harvey,Protoplasma 58 (1964), 42–74.
[11] A. Lindenmayer, Mathematical models for cellular interactions in development, Part I and Part II,Journal of Theoretical Biology 18 (1968), 280–299, 300–315.
[12] A. Lindenmayer, Developmental systems without cellular interactions, their languages and grammars,J. Theoretical Biology 30 (1971), 455–485.
[13] A. Lindenmayer andG. Rozenberg, Developmental systems and languages,Proc. 4th Annual ACM Symp. on Theory of Computing (1972), 214–221. · Zbl 0353.68087
[14] G. F. Rose, An extension of algol-like languages,Comm. ACM 7 (1964), 52–61. · Zbl 0192.07104
[15] G. Rozenberg, Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problems for OL-systems,Information Processing Letters 1 (1972), 233–235. · Zbl 0249.68029
[16] G. Rozenberg,L-systems with interactions,J. Computer System Sciences, to appear.
[17] G. Rozenberg andP. Doucet, On OL-languages,Information and Control 19 (1971), 302–318. · Zbl 0242.68052
[18] G. Rozenberg andA. Lindenmayer, Developmental systems with locally catenative formulas,Acta Information 2 (1973), 214–248. · Zbl 0304.68076
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.