Call Number (LC) Title Results
QA267 .C5933 1988 Conditional term rewriting systems 1st international workshop, Orsay, France, July 8-10, 1987 : proceedings /
Conditional term rewriting systems, 1st international workshop, Orsay, France, July 8-10, 1987 : proceedings / 		2
QA267 .C6 1965 Systems and computer science / 1
QA267 .D36 2010 Discrete, continuous, and hybrid Petri Nets 1
QA267 .D3713 1992 Petri nets and Grafcet : tools for modelling discrete event systems / 1
QA267 .D38 1983 Computability, complexity, and languages : fundamentals of theoretical computer science /
Computability, complexity, and languages fundamentals of theoretical computer science / 		3
QA267 .D38 1994 Computability, complexity, and languages : fundamentals of theoretical computer science / 1
QA267 .D38 1994eb Computability, complexity, and languages : fundamentals of theoretical computer science / 1
QA267 .D43 1987 Lectures on the complexity of bilinear problems / 1
QA267 .D45 Machines, languages, and computation / 3
QA267 .D465 1995 Free choice Petri nets /
Free choice petri nets / 		2
QA267 .D67 1995 Efficient graph rewriting and its implementation / 1
QA267 .D8 2001 Problem solving in automata, languages, and complexity / 1
QA267 .D8 2001eb Problem solving in automata, languages, and complexity 1
QA267 .D86 1988 The complexity of Boolean networks / 1
QA267 .E26 1984 Automata on infinite words /
Automata on infinite words 		2
QA267 .E97 1980 Application and theory of Petri nets : selected papers from the First and the Second European Workshop on Application and Theory of Petri Nets, Strasbourg, 23-26 September 1980, Bad Honnef, 28-30 September 1981 / 1
QA267 .F3 1973eb 1. Fachtagung über Automatentheorie und Formale Sprachen Bonn, 9.-12. Juli 1973 / 1
QA267 .F54 2001 Formal models of computation : the ultimate limits of computing / 1
QA267 .F64 2000 Introduction to process algebra / 1
QA267 .F68 Foundations of computer science III / 1