Adel’son-Vel’skij, G. M.; Slisenko, A. O. What can we do with problems of exhaustive search? (Russian) Zbl 0573.68014 Algorithms in modern mathematics, II, Mater. Int. Symp., Urgench/UzSSR, 1979, 93-123 (1982). MSC: 68Q25 68-02 PDFBibTeX XML
Nijholt, Anton Precedence relations: A bibliography. (English) Zbl 0565.68066 SIGACT News 14, No. 2, 9-19 (1982). MSC: 68Q45 68N20 00A15 68Q42 PDFBibTeX XML
Batini, C.; D’Atri, A.; Moscarini, M. Formal tools for top-down and bottom-up generation of acyclic relational schemata. (English) Zbl 0549.68096 Graphtheoretic concepts in computer science, Proc. 7th Conf., Linz/Austria 1981, 219-229 (1982). MSC: 68P20 68Q45 05C65 68R10 PDFBibTeX XML
Bene, Béla On the probabilistic graph L-systems. (English) Zbl 0549.68045 Dep. Math., Karl Marx Univ. Econ., Budap. 1982-2, 47-58 (1982). MSC: 68Q42 92B05 PDFBibTeX XML
Witt, K.-U. Finite graph-automata. (English) Zbl 0539.68071 Graphtheoretic concepts in computer science, Proc. 7th Conf., Linz/Austria 1981, 45-53 (1982). MSC: 68Q45 PDFBibTeX XML
Ehrig, Hartmut; Hoffmann, Berthold; Schmiedecke, Ilse-R. A graph theoretical model for multi-pass parsing. (English) Zbl 0538.68065 Graphtheoretic concepts in computer science, Proc. 7th Conf., Linz/Austria 1981, 19-31 (1982). MSC: 68N20 68S05 68Q45 PDFBibTeX XML
Janssens, D.; Kreowski, H.-J.; Rozenberg, G.; Ehrig, H. Concurrency of node-label-controlled graph transformations. (English) Zbl 0538.68057 Graphtheoretic concepts in computer science, Proc. 8th Conf., Neunkirchen/Ger. 1982, 91-108 (1982). MSC: 68Q45 PDFBibTeX XML
Mahr, B.; Wilharm, A. Graph grammars as a tool for description in computer processed control: A case study. (English) Zbl 0532.68093 Graphtheoretic concepts in computer science, Proc. 8th Conf., Neunkirchen/Ger. 1982, 165-176 (1982). MSC: 68U99 68Q45 93C99 90B35 PDFBibTeX XML
Kaul, M. Linear precedence parsing for a new class of graph grammars. (English) Zbl 0532.68079 Graphtheoretic concepts in computer science, Proc. 7th Conf., Linz/Austria 1981, 33-43 (1982). MSC: 68N20 68Q45 PDFBibTeX XML
Janssens, D.; Rozenberg, G.; Verraedt, R. On sequential and parallel node-rewriting graph grammars. (English) Zbl 0531.68030 Comput. Graphics Image Process. 18, 279-304 (1982). MSC: 68Q45 68R10 PDFBibTeX XMLCite \textit{D. Janssens} et al., Comput. Graphics Image Process. 18, 279--304 (1982; Zbl 0531.68030) Full Text: DOI
Bene, Bela Graph generation systems and languages. (Hungarian) Zbl 0524.68035 Alkalmazott Mat. Lapok 8, 251-283 (1982). MSC: 68Q42 68Q45 PDFBibTeX XMLCite \textit{B. Bene}, Alkalmazott Mat. Lapok 8, 251--283 (1982; Zbl 0524.68035)
Lueck, Hermann B.; Lueck, Jacqueline Tomological representation of growing theoretical plant tissues. (English) Zbl 0508.92001 Mathematics at the service of man, Proc. 2nd World Conf., Las Palmas/Spain 1982, 457-466 (1982). MSC: 92B05 68R10 PDFBibTeX XML
Witt, Kurt-Ulrich Finite graph-recognizers and regular graph-grammars. (English) Zbl 0503.68058 Mathematics at the service of man, Proc. 2nd World Conf., Las Palmas/Spain 1982, 664-670 (1982). MSC: 68Q45 PDFBibTeX XML
Cori, Marcel Description d’une classe de grammaires de graphes sans circuit. (French) Zbl 0497.68043 RAIRO, Inf. Théor. 16, 33-49 (1982). MSC: 68Q45 68R10 PDFBibTeX XMLCite \textit{M. Cori}, RAIRO, Inf. Théor. 16, 33--49 (1982; Zbl 0497.68043) Full Text: EuDML
Brandenburg, Franz J. The computational complexity of certain graph grammars. (English) Zbl 0495.68038 Theoretical computer science, 6th GI-Conf., Dortmund 1983, Lect. Notes Comput. Sci. 145, 91-99 (1982). MSC: 68Q25 68Q45 68Q05 PDFBibTeX XML
Janssens, D.; Rozenberg, G. Graph grammars with neighbourhood-controlled embedding. (English) Zbl 0486.68075 Theor. Comput. Sci. 21, 55-74 (1982). MSC: 68Q45 PDFBibTeX XMLCite \textit{D. Janssens} and \textit{G. Rozenberg}, Theor. Comput. Sci. 21, 55--74 (1982; Zbl 0486.68075) Full Text: DOI
Keohane, John; Cherniavsky, John C.; Henderson, Peter B. On transforming control structures. (English) Zbl 0479.68010 SIAM J. Comput. 11, 268-286 (1982). MSC: 68N01 68N25 PDFBibTeX XMLCite \textit{J. Keohane} et al., SIAM J. Comput. 11, 268--286 (1982; Zbl 0479.68010) Full Text: DOI