Search results for "introduction to python programming"
Items we need to order for you
R 1,015.19
Introduction to Formal Language Theory
The study of formal languages and of related families of automata has long been at the core of theoretical computer science. Until recently, the main reasons for this centrality were connected with the specification and analy sis of programming languages, which led naturally to the following ques tions. How might a grammar be written for such a language? How could we check whether a text were or were not a well-formed program generated by that grammar? How could we parse a program to provide the structural analysis needed by a compiler? How could we check for ambiguity to en sure that a program has a unique analysis to be passed to the computer? This focus on programming languages has now been broadened by the in creasing concern of computer scientists with designing interfaces which allow humans to communicate with computers in a natural language, at least concerning problems in some well-delimited domain of discourse. The necessary work in computational linguistics draws on studies both within linguistics (the analysis of human languages) and within artificial intelligence. The present volume is the first textbook to combine the topics of formal language theory traditionally taught in the context of program ming languages with an introduction to issues in computational linguistics. It is one of a series, The AKM Series in Theoretical Computer Science, designed to make key mathematical developments in computer science readily accessible to undergraduate and beginning graduate students.
R 1,542.57
Introduction to String Diagrams for Computer Scientists
String diagrams are a powerful graphical language used to represent computational phenomena across diverse scientific fields, including computer science, physics, linguistics, amongst others. The appeal of string diagrams lies in their multi-faceted nature: they offer a simple, visual representation of complex scientific ideas, while also allowing rigorous mathematical treatment. Originating in category theory, string diagrams have since evolved into a versatile formalism, extending well beyond their abstract algebraic roots, and offering alternative entry points to their study. This text provides an accessible introduction to string diagrams from the perspective of computer science. Rather than starting from categorical concepts, the authors draw on intuitions from formal language theory, treating string diagrams as a syntax with its own semantics. They survey the basic theory, outline fundamental principles, and highlight modern applications of string diagrams in different fields. This title is also available as open access on Cambridge Core.
R 865.00
Introduction to Mathematical Logic
This book grew out of lectures. It is intended as an introduction to classical two-valued predicate logic. The restriction to classical logic is not meant to imply that this logic is intrinsically better than other, non-classical logics; however, classical logic is a good introduction to logic because of its simplicity, and a good basis for applications because it is the foundation of classical mathematics, and thus of the exact sciences which are based on it. The book is meant primarily for mathematics students who are already acquainted with some of the fundamental concepts of mathematics, such as that of a group. It should help the reader to see for himself the advantages of a formalisation. The step from the everyday language to a formalised language, which usually creates difficulties, is dis cussed and practised thoroughly. The analysis of the way in which basic mathematical structures are approached in mathematics leads in a natural way to the semantic notion of consequence. One of the substantial achievements of modern logic has been to show that the notion of consequence can be replaced by a provably equivalent notion of derivability which is defined by means of a calculus. Today we know of many calculi which have this property.
R 1,564.58
Introduction to the Technique of Formative Processes in Set Theory
This book presents an intuitive picture-oriented approach to the formative processes technique and to its applications. In the first part the authors introduce basic set-theoretic terminology and properties, the decision problem in set theory, and formative processes. The second part of the book is devoted to applications of the technique of formative processes to decision problems.All chapters contain exercises and the book is appropriate for researchers and graduate students in the area of computer science logic.
R 1,535.07
