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 language are equivalent. Chapter Four covers the context-free languages, whereas Chapter Five clarifies the relationship between LR(k) languages and deterministic (context-free languages). Chiswell's book is unique in that it gives the reader a thorough introduction into the connections between group theory and formal languages. This information, contained within the final chapter, includes work on the Anisimov and Muller-Schupp theorems.

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

Chen W.W.L. Discrete Mathematics

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

Macquarie University, Siydney, 1982, -190 pp. This set of notes has been compiled over a period of more than 25 years. Chapters 1-4 were used in various forms and on many occasions between 1981 and 1990 by the author at Imperial College, University of London. An extra 14 chapters were written in Sydney in 1991 and 1992. Chapters 7 and 12 were added in 1997. The material has been organized in such a way to create a single volume suitable for use i...

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...

Epstein D.B., Cannon J.W., Holt D.F. et al. Word Processing in Groups

формат djvu
размер 2.7 МБ
добавлен 05 сентября 2011 г.

Jones and Bartlett Publishers, 1992. - 352 Pages. This study in combinatorial group theory introduces the concept of automatic groups. It contains a succinct introduction to the theory of regular languages, a discussion of related topics in combinatorial group theory, and the connections between automatic groups and geometry which motivated the development of this new theory. It is of interest to mathematicians and computer scientists, and inclu...

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...

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 ba...

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...

McEvoy K., Tucker J.V. Theoretical Foundations of VLSI Design

формат djvu
размер 3.02 МБ
добавлен 02 февраля 2012 г.

Издательство Cambridge University Press, 1990, -443 pp. The development of VLSI fabrication technology has resulted in a wide range of new ideas for application specific hardware and computer architectures, and in an extensive set of significant new theoretical problems for the design of hardware. The design of hardware is a process of creating a device that realises an algorithm, and many of the problems are concerned with the nature of algorith...

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...