Posted by **arundhati** at Oct. 7, 2015

2004 | ISBN-10: 9810247273 | 212 pages | PDF | 10 MB

Posted by **tanas.olesya** at March 19, 2015

English | Dec 30, 2004 | ISBN: 0898715695 | 271 Pages | PDF | 15 MB

Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories.

Posted by **tanas.olesya** at Sept. 30, 2014

Springer; 1 edition | December 13, 1996 | English | ISBN: 3540570632 | 214 pages | PDF | 10 MB

This volume is the first in a projected series devoted to the mathematical and philosophical works of the late Claude Chevalley. It covers the main contributions by the author to the theory of spinors. Since its appearance in 1954, "The Algebraic Theory of Spinors" has been a much sought after reference. It presents the whole story of one subject in a concise and especially clear manner.

Posted by **step778** at July 9, 2013

1996 | pages: 214 | ISBN: 3540570632 | PDF | 8,5 mb

Posted by **karapuzik** at Dec. 12, 2008

360 pages | New Age International (P) Ltd. (2006) | ISBN-10: 8122415083 | PDF | 2 Mb

This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. The book is devoted to finite automata and their properties. Pushdown automata provides a class of models and enables the analysis of context-free languages. Turing machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems.

Posted by **MoneyRich** at Dec. 11, 2014

English | July 17, 2000 | ISBN: 1852330740 | 920 pages | PDF | 70 MB

A step-by-step development of the theory of automata, languages and computation. Intended for use as the basis of an introductory course at both junior and senior levels, the text is organized so as to allow the design of various courses based on selected material. It features basic models of computation, formal languages and their properties; computability, decidability and complexity; a discussion of modern trends in the theory of automata and formal languages; design of programming languages, including the development of a new programming language; and compiler design, including the construction of a complete compiler. Alexander Meduna uses clear definitions, easy-to-follow proofs and helpful examples to make formerly obscure concepts easy to understand. He also includes challenging exercises and programming projects to enhance the reader's comprehension, and many 'real world' illustrations and applications in practical computer science.

Posted by **libr** at Dec. 21, 2016

English | 2014 | ISBN: 1848216157 | 336 pages | PDF | 3 MB

Posted by **interes** at Sept. 15, 2014

English | 2014 | ISBN: 1848216157 | 336 pages | PDF | 3 MB

Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory).

Posted by **interes** at Jan. 12, 2017

English | 2011 | ISBN: 1610162358 | 262 pages | epub | 0,3 MB

Posted by **ksveta6** at Jan. 8, 2017

2016 | ISBN: 0231177240 | English | 272 pages | EPUB | 0.9 MB