Posted by **bookwyrm** at Aug. 27, 2013

1997 | 400 Pages | ISBN: 0387949070 | DJVU | 3 MB

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

English | 2014 | ISBN: 1848217889 | 272 pages | PDF | 3 MB

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

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

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 **roxul** at Nov. 26, 2014

English | ISBN: 144961552X | 2012 | 437 pages | EPUB | 4 MB

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

English | 2014 | ISBN: 1848217889 | 272 pages | PDF | 3 MB

The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a “simple” binary expansion, by B. Adamczewski and Y. Bugeaud.

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 **lengen** at April 18, 2017

English | Feb. 21, 1994 | ISBN: 0201626640 | 587 Pages | PDF | 188 MB

Are mathematical equations the best way to model nature? For many years it had been assumed that they were. But in the early 1980s, Stephen Wolfram made the radical proposal that one should instead build models that are based directly on simple computer programs. Wolfram made a detailed study of a class of such models known as cellular automata, and discovered a remarkable fact: that even when the underlying rules are very simple, the behavior they produce can be highly complex, and can mimic many features of what we see in nature.

Posted by **ksveta6** at Feb. 16, 2017

2016 | ISBN: 1284070409 | English | 1040 pages | EPUB | 15 MB

Posted by **DZ123** at Jan. 26, 2017

English | 2002 | ISBN: 1588112470 | PDF | pages: 341 | 1.7 mb