CAAP '90 : 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 1990, proceedings /

CAAP '90 : 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 1990, proceedings /

Saved in:

Bibliographic Details
Meeting name:	Colloquium on Trees in Algebra and Programming (15th : 1990 : Copenhagen, Denmark)
Imprint:	Berlin ; New York : Springer-Verlag, ©1990.
Description:	1 online resource (vi, 284 pages) : illustrations.
Language:	English
Series:	Lecture notes in computer science, 0302-9743 ; 431 Lecture notes in computer science ; 431.
Subject:	Trees (Graph theory) -- Data processing -- Congresses. Data structures (Computer science) -- Congresses. Computational complexity -- Congresses. Arbres (Théorie des graphes) -- Informatique -- Congrès. Complexité de calcul (Informatique) -- Congrès. Structures de données (Informatique) -- Congrès. Computational complexity. Data structures (Computer science) Trees (Graph theory) -- Data processing. Computabilidade e modelos de computacao. Electronic books. Conference papers and proceedings.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11074002

Hidden Bibliographic Details
Other authors / contributors:	Arnold, A. (André), 1945-
ISBN:	9783540470427 3540470425 3540525904 9783540525905 0387525904 9780387525907
Notes:	Includes bibliographical references and index. Restrictions unspecified Electronic reproduction. [S.l.] : HathiTrust Digital Library, 2010. Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 digitized 2010 HathiTrust Digital Library committed to preserve Online resource; title from PDF title page (SpringerLink, viewed Aug. 14, 2013).
Summary:	This volume contains the proceedings of the Fifteenth Colloquium on Trees in Algebra and Programming. The papers selected present new research results and cover the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered as that of sets of discrete structures and the theory of rewriting systems over these objects. - Application of discrete structures in computer science, including syntax and semantics of programming languages, operational semantics, logic programming, algorithms and data structures, complexity of algorithms and implementation aspects, proof techniques for nonnumerical algorithms, formal specifications, and visualization of trees and graphs.
Other form:	Print version: Colloquium on Trees in Algebra and Programming (15th : 1990 : Copenhagen, Denmark). CAAP '90. Berlin ; New York : Springer-Verlag, ©1990