Matthias Jantzen – författare
Visar alla böcker från författaren Matthias Jantzen. Handla med fri frakt och snabb leverans.
6 produkter
Confluent String Rewriting
Inbunden, 1988
568 kr
Lägg i varukorg
Replacement systems, such as term rewriting systems, tree manipulat ing systems, and graph grammars, have been used in Computer Science in the context of theorem proving, program optimization, abstract data types, algebraic simplification, and symbolic comput ation. Replacement systems for …
STACS 91
8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991. Proceedings
Av Christian Choffrut, Matthias Jantzen
Häftad, 1991
1128 kr
Lägg i varukorg
This volume contains the proceedings of STACS 91, a symposium on the theoretical aspects of computer science, held in Hamburg, Germany in February 1991. STACS is held each year, alternately in Germany and France, and is organized jointly by the Special Interest Group for Theoretical Computer …
STACS 92
9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings
Av Alain Finkel, Matthias Jantzen
Häftad, 1992
1128 kr
Lägg i varukorg
This volume gives the proceedings of the ninth Symposium onTheoretical Aspects of Computer Science (STACS). Thisannual symposium is held alternately in France and Germanyand is organized jointly by the Special Interest Group forFundamental Computer Science of the Association Francaisedes Sciences …
Foundations of Computer Science
Potential-Theory-Cognition
Av Christian Freksa, Matthias Jantzen m. fl.
Häftad, 1997
1128 kr
Lägg i varukorg
This book constitutes an anthology of refereed papers arranged to acknowledge the work of Wilfried Brauer on the occasion of his sixtieth birthday. The volume presents 49 revised refereed papers organized in topical sections on computer science and its potential, social implications of computer …
Confluent String Rewriting
E-bok, 2012
732 kr
Lägg i varukorg
Replacement systems, such as term rewriting systems, tree manipulat ing systems, and graph grammars, have been used in Computer Science in the context of theorem proving, program optimization, abstract data types, algebraic simplification, and symbolic comput ation. Replacement systems for …
Confluent String Rewriting
Häftad, 2011
568 kr
Lägg i varukorg
Replacement systems, such as term rewriting systems, tree manipulat ing systems, and graph grammars, have been used in Computer Science in the context of theorem proving, program optimization, abstract data types, algebraic simplification, and symbolic comput ation. Replacement systems for …
