The Online Books Page

Graph grammars

See also what's at your library, or elsewhere.

Broader terms:

Used for:

Grammars, Graph

Filed under: Graph grammars

An Architecture for Combinator Graph Reduction, by Philip Koopman (PDF files with commentary at CMU)

Items below (if any) are from related and broader terms.

Filed under: Formal languages

A comparative discussion of variable-valued logic and grammatical inference (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1974), by A. B. Baskin (page images at HathiTrust)
Degrees of unsolvability in the theory of programming languages (Dept. of Computer Science, University of Illinois, 1971), by Dennis F. Cudia (page images at HathiTrust)
An implementation of a system for the formal definition of programming languages (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1978), by Brian Alfred Hansche (page images at HathiTrust)
LINGOL, a readable formalism for programming language semantics (Dept. of Computer Science, University of Illinois, 1977), by Garry R. Kampen (page images at HathiTrust)
On the covering problem for unambiguous context-free grammars (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1974), by M. Dennis Mickunas (page images at HathiTrust)
On the strong covering problem for LR(k) grammars (Dept., of Computer Science, University of Illinois, 1974), by M. Dennis Mickunas (page images at HathiTrust)
Probabilistic languages and automata. (Dept. of Computer Science, University of Illinois, 1969), by Clarence Arthur Ellis (page images at HathiTrust)

Filed under: Formal languages -- Semantics

An algebraic definition of Knuthian semantics (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1977), by Laurian M. Chirica and David F. Martin (page images at HathiTrust)

Filed under: L systems

Lindenmayer Systems, Fractals, and Plants (free electronic edition; c2016), by Przemyslaw Prusinkiewicz and James Hanan
- PDF at algorithmicbotany.org; site may give security warning
- PDF at Wayback Machine
The Algorithmic Beauty of Plants (free electronic edition, c2004), by Przemyslaw Prusinkiewicz and Aristid Lindenmayer
- PDF files with commentary at algorithmicbotany.org; site may give security warning
- PDF files with commentary at Wayback Machine

Filed under: Parsing (Computer grammar)

Parsing Techniques: A Practical Guide (first edition, with minor corrections; 1998), by Dick Grune and Ceriel J. H. Jacobs (PDF and Postscript at dickgrune.com)
On the generation of parsers for BNF grammars: an algorithm (Urbana, 1968), by Franklin L. DeRemer (page images at HathiTrust)
On the relative efficiencies of context-free grammar recognizers (L.G. Hansom Field, Bedford, Massachusetts : Air Force Cambridge Research Laboratories, Office of Aerospace Research, United States Air Force, 1965., 1965), by T. V. Griffiths, S. R. Petrick, Air Force Cambridge Research Laboratories (U.S.), and United States. Air Force. Office of Aerospace Research (page images at HathiTrust)

Filed under: Graph theory

Graph Theory (free electronic edition, 2016), by Reinhard Diestel (PDF files at graph-theory.com)
Theory of Graphs (American Mathematical Society Colloquium Publications v38, first edition; 1962), by Øystein Ore (page images at HathiTrust)
Basic Neutrosophic Algebraic Structures and Their Application to Fuzzy and Neutrosophic Models, by W. B. Vasantha Kandasamy and Florentin Smarandache (PDF at UNM)
The representation theory of finite graphs and associated algebras ([Ottawa? Can.], 1973), by Peter Donovan and Mary Ruth Freislich (page images at HathiTrust)
Web grammars (University of Maryland, Computer Science Center], 1969), by John L. Pfaltz and Azriel Rosefeld (page images at HathiTrust; US access only)
Separable graphs, planar graphs and web grammars (University of Maryland, Computer Science Center], 1969), by U. Montanari (page images at HathiTrust; US access only)
On certain information-theoretic concepts in the theory of graphs (For sale by the Clearinghouse for Federal Scientific and Technical Information, 1966), by M. Christine Wilson, United States National Aeronautics and Space Administration, and Kent State University (page images at HathiTrust)
Clustering by clique generation (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1974), by Chih-Meng Cheng and University of Illinois at Urbana-Champaign : Deptartment of Computer Science (page images at HathiTrust)
Decomposition of graphs into trees (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1977), by Shmuel Zaks and C. L. Liu (page images at HathiTrust)
A generalization of Ramsey theory for graphs (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1976), by Kin Man Chung and C. L. Liu (page images at HathiTrust)
A generalization of Ramsey theory for graphs, with stars and complete graphs as forbidden subgraphs (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1977), by Kin Man Chung, C. L. Liu, and M. L. Chung (page images at HathiTrust)
A generalization of Ramsey theory for graphs (Dept. of Computer Science, University of Illinois, 1977), by C. L. Liu and Kim Man Chung (page images at HathiTrust)
Generalized Ramsey numbers for stars (Department of Computer Science, University of Illinois at Urbana-Champaign, 1981), by W. D. Wei, C. L. Liu, and University of Illinois at Urbana-Champaign. Department of Computer Science (page images at HathiTrust)
A graph-structure transformation model for picture parsing (Dept. of Computer Science, University of Illinois, 1972), by John C. Schwebel (page images at HathiTrust)
A procedure for detecting intersections and its application. (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1971), by Kiyoshi Maruyama (page images at HathiTrust)
Scheduling on parallel processors for weighted-node graphs. (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1972), by Janet Sau-Ying Chin (page images at HathiTrust)
A switching theory for bilateral nets of threshold elements. (Urbana, 1963), by William Donald Frazer (page images at HathiTrust)
A tricolor cartograph (Urbana, 1968), by William J. Kubitz (page images at HathiTrust)
Weak congruence relations on graphs (Dept. of Computer Science, 1966), by Raymond Tzuu-Yau Yeh (page images at HathiTrust)
Synthesis techniques for transformations on tree and graph structures (Dept. of Computer Science, University of Illinois, 1977), by Gregory Lawrence Chesson (page images at HathiTrust)
On a Conjecture of H. Hadwiger (Washington, D.C. : United States Air Force, Office of Scientific Research, 1958., 1958), by Branko Gr©·unbaum, United States. Air Force. Office of Scientific Research, and N.J.) Institute for Advanced Study (Princeton (page images at HathiTrust)

Filed under: Graph theory -- Data processing

Graph Representation Learning (prepublication version, 2020), by William L. Hamilton (PDF at McGill)
Average analysis of simple path algorithms (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1977), by Yehoshua Perl (page images at HathiTrust)
Deficient generalized Fibonacci maximum path graphs (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1978), by Yehoshua Perl and Shmuel Zaks (page images at HathiTrust)
Generation and comparison of equivalent equation sets in a general purpose simulation and modeling package (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1975), by Sally Foote Wilkins and University of Illinois at Urbana-Champaign. Dept. of Computer Science (page images at HathiTrust)
An NP-complete matching problem (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1979), by David A. Plaisted (page images at HathiTrust)
On algorithms for finding all circuits of a graph (Dept. of Computer Science, University of Illinois, 1973), by Prabhaker Mateti and Narsingh Deo (page images at HathiTrust)
Parallel algorithms for network routing problems and recurrences (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1979), by J. A. Wisniewski and Ahmed Sameh (page images at HathiTrust)
Picture analysis by graph transformation (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1973), by Ahmad E Masumi (page images at HathiTrust)
Studies in graph algorithms : generation and labeling problems (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1979), by Shmuel Zaks (page images at HathiTrust)
Two upper bounds for the weighted path length of binary trees. (Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1973), by Jean Louis Pradels (page images at HathiTrust)

Filed under: Graph theory -- Periodicals

Theory and Applications of Graphs (2014-) (full serial archives)
Majalah Ilmiah Matematika dan Statistika (in Indonesian and English; 2015-) (partial serial archives)
Ars Mathematica Contemporanea (2008-) (partial serial archives)
Transactions on Combinatorics (2012-) (partial serial archives)
Electronic Journal of Graph Theory and Applications (2013-) (partial serial archives)
Applied Mathematics and Nonlinear Sciences (2016-) (partial serial archives)
Indonesian Journal of Combinatorics (2016-) (partial serial archives)
The American Journal of Combinatorics (2022-) (partial serial archives)

More items available under broader and related terms at left.

Help with reading books -- Report a bad link -- Suggest a new listing

Home -- Search -- New Listings -- Authors -- Titles -- Subjects -- Serials

Books -- News -- Features -- Archives -- The Inside Story

Edited by John Mark Ockerbloom (onlinebooks@pobox.upenn.edu)
OBP copyrights and licenses.