Ito M. Automata, Formal Languages and Algebraic Systems

формат pdf
размер 1.69 МБ
добавлен 18 октября 2011 г.

World Scientific Publishing Company, 2010. - 248 pages.

This volume consists of papers selected from the presentations at the workshop and includes mainly recent developments in the fields of formal languages, automata theory and algebraic systems related to the theoretical computer science and informatics. It covers the areas such as automata and grammars, languages and codes, combinatorics on words, cryptosystems, logics and trees, Grobner bases, minimal clones, zero-divisor graphs, fine convergence of functions, and others.

Смотрите также

Alonso-Sanz R. Discrete Systems with Memory

формат pdf
размер 37.93 МБ
добавлен 14 ноября 2011 г.

World Scientific Publishing, 2011, 465 pages Memory is a universal function of organized matter. What is the mathematics of memory? How does memory affect the space-time behaviour of spatially extended systems? Does memory increase complexity? This book provides answers to these questions. It focuses on the study of spatially extended systems, i.e., cellular automata and other related discrete complex systems. Thus, arrays of locally connecte...

Chiswell I.M. A Course in Formal Languages, Automata and Groups

формат pdf
размер 1.14 МБ
добавлен 25 ноября 2011 г.

Springer, 2008. - 161 pages. The study of formal languages and automata has proved to be a source of much interest and discussion amongst mathematicians in recent times. This book, written by Professor Ian Chiswell, attempts to provide a comprehensive textbook for undergraduate and postgraduate mathematicians with an interest in this developing field. The first three Chapters give a rigorous proof that various notions of recursively enumerable...

Davis M.D., Weyuker E.J. Computability, Complexity, and Languages

формат djvu
размер 2.47 МБ
добавлен 24 октября 2011 г.

Издательство Academic Press, 1983, -435 pp. Theoretical computer science is the mathematical study of models of computation. As such, it originated in the 1930s, well before the existence of modern computers, in the work of the logicians Church, Godel, Kleene, Post, and Turing. This early work has had a profound influence on the practical and theoretical development of computer science. Not only has the Turing-machine model proved basic for theo...

Ehrig H., Ehrig K., Prange U., Taentzer G. Fundamentals of Algebraic Graph Transformation

формат pdf
размер 2.54 МБ
добавлен 24 октября 2011 г.

Издательство Springer, 2006, -373 pp. In the late 1960s and early 1970s, the concepts of graph transformation and graph grammars started to become of interest in picture processing and computer science. The main idea was to generalize well-known rewriting techniques from strings and trees to graphs, leading to graph transformations and graph grammars. In particular, the concepts of algebraic graph transformation gained considerable importance in...

Gazeau J.-P., Ne?et?il N., Rovan B. (eds.) Physics and Theoretical Computer Science. From Numbers and Languages to (Quantum) Cryptography

формат pdf
размер 5.86 МБ
добавлен 31 января 2012 г.

Издательство IOS Press, 2007, -348 pp. As a part of the NATO Security Through Science Programme, the goal of the Advanced Study Institute Physics and Computer Science was to reinforce the interface between physical sciences, theoretical computer science, and discrete mathematics. No one can dispute the current importance of applied as well as theoretical Computer Science in the development and the practice of Physical Sciences. Physicists of cou...

Hachtel G.D., Somenzi F. Logic Synthesis and Verification Algorithms

формат pdf
размер 39.81 МБ
добавлен 24 октября 2011 г.

Издательство Kluwer, 2002, -568 pp. This book grew from courses taught at the University of Colorado (Boulder) and at the Universidad Politecnica de Madrid, Spain. As the title suggests, we were motivated by two disparate objectives. First, the VLSI CAD group at Boulder was given the responsibility for teaching a course which satisfied the ABET requirement for an upper division algorithms and discrete mathematics course in a EE or ECE curriculum...

Linz P. An Introduction to Formal Languages and Automata

формат pdf
размер 20.96 МБ
добавлен 10 декабря 2011 г.

Jones & Bartlett Publishers, 2000. - 397 pages. This text covers all the material essential to an introductory theory of computation course for undergraduate students. The text has a solid mathematical base, and provides precise mathematical statements of theorems and definitions, giving an intuitive motivation for constructions and proofs. Proofs and arguments are clearly stated, without excessive mathematical detail, to help students und...

Lothaire M. Algebraic Combinatorics on Words

формат djvu
размер 4.52 МБ
добавлен 15 декабря 2011 г.

Издательство Cambridge University Press, 2002, -515 pp. Combinatorics on words is a field that has grown separately within several branches of mathematics, such as number theory, group theory or probability theory, and appears frequently in problems of theoretical computer science, as dealing with automata and formal languages. A unified treatment of the theory appeared in Lothaire's Combi- Combinatorics on Words. Since then, the field has grown...

McNaughton R. Elementary Computability, Formal Languages, and Automata

формат djvu
размер 3.4 МБ
добавлен 24 августа 2011 г.

Prentice Hall, 1982. - 417 Pages. This book is an introduction to theoretical computer science emphasizing two interrelated areas: the theory of computability (how to tell whether problems are algorithmically solvable) and the theory of formal languages (how to design and use special languages, as for algorithms). Automata (idealized computer devices) are used as precise models of computation in studies that have actual computers as their primar...

Savage J.E. Models of Computation. Exploring the Power of Computing

формат pdf
размер 4.2 МБ
добавлен 28 октября 2011 г.

Издательство Addison-Wesley, 1998, -699 pp. Theoretical computer science treats any computational subject for which a good model can be created. Research on formal models of computation was initiated in the 1930s and 1940s by Turing, Post, Kleene, Church, and others. In the 1950s and 1960s programming languages, language translators, and operating systems were under development and therefore became both the subject and basis for a great deal of...