Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
A Half-century of Automata Theory
Annotation Eleven pioneers in the field reminisce about the development of automata theory and suggest possible future directions for the field, in these seven papers from a July 2000 symposium held at the University of Western Ontario, Canada. Specific topics include hazard algebras, undecidability and incompleteness results in automata theory, playing infinite games in finite time, gene assembly in ciliates, and compositions over a finite domain. This work lacks a subject index. Salomaa is affiliated with the Turku Center for Computer Science, Finland. Annotation c. Book News, Inc., Portland, OR (booknews.com).
Fundamentals of Computation Theory
This book constitutes the refereed proceedings of the 14th International Symposium Fundamentals of Computation Theory, FCT 2003, held in Malmö, Sweden in August 2003. The 36 revised full papers presented together with an invited paper and the abstracts of 2 invited talks were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on approximibility, algorithms, networks and complexity, computational biology, computational geometry, computational models and complexity, structural complexity, formal languages, and logic.
Jewels are Forever
Dedicated to Arto Salomaa, a towering figure of theoretical computer science, on the occasion of his 65th birthday, this book is a tribute to him on behalf of the theoretical computer science community. The contributions are written by internationally recognized scientists and cover most of Salomaa's many research areas. Due to its representative selection of classic and cutting edge trends in theoretical computer science, the book constitutes a comprehensive state-of-the-art survey. The contributions are in such central areas as automata theory, algorithms and complexity, and combinatorics of words. But not only that, they take up new areas such as regular sets and biocomputing. While some are survey articles of fundamental topics, most are original research papers.
Formal Languages and Applications
Formal Languages and Applications provides a comprehensive study-aid and self-tutorial for graduates students and researchers. The main results and techniques are presented in an readily accessible manner and accompanied by many references and directions for further research. This carefully edited monograph is intended to be the gateway to formal language theory and its applications, so it is very useful as a review and reference source of information in formal language theory.
Developments in Language Theory
This book constitutes the refereed proceedings of the 12th International Conference on Developments in Language Theory, DLT 2008, held in Kyoto, Japan, September 2008. The 36 revised full papers presented together with 6 invited papers were carefully reviewed and selected from 102 submissions. All important issues in language theory are addressed including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; algorithmic, combinatorial and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory and logic; bio-inspired computing; quantum computing.
Fundamentals of Computation Theory
This book constitutes the refereed proceedings of the 13th International Symposium Fundamentals of Computation Theory, FCT 2001, as well as of the International Workshop on Efficient Algorithms, WEA 2001, held in Riga, Latvia, in August 2001. The 28 revised full FCT papers and 15 short papers presented together with six invited contributions and 8 revised full WEA papers as well as three invited WEA contributions have been carefully reviewed and selected. Among the topics addressed are a broad variety of topics from theoretical computer science, algorithmics and programming theory. The WEA papers deal with graph and network algorithms, flow and routing problems, scheduling and approximation algorithms, etc.
Half-century Of Automata Theory, A: Celebration And Inspiration
This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of automata theory are reminisced about and future directions are suggested. Although some of the contributions go into rather intriguing technical details, most of the book is accessible to a wide audience interested in the progress of the age of computers.The book is a must for professionals in theoretical computer science and related areas of mathematics. For students in these areas it provides an exceptionally deep view at the beginning of the new millennium.
Theory Is Forever
This commemorative book celebrates the 70th birthday of Arto Kustaa Salomaa, one of the most influential researchers in theoretical computer science. The 24 invited papers by leading researchers in the area address a broad variety of topics in theoretical computer science and impressively reflect the breadth and the depth of Arto Salomaa's scientific work.
Words, Semigroups, And Transductions: Festschrift In Honor Of Gabriel Thierrin
This is an excellent collection of papers dealing with combinatorics on words, codes, semigroups, automata, languages, molecular computing, transducers, logics, etc., related to the impressive work of Gabriel Thierrin. This volume is in honor of Professor Thierrin on the occasion of his 80th birthday.
Algebraic Informatics
This book constitutes the refereed proceedings of the Second International Conference on Algebraic Informatics, CAI 2007, held in Thessaloniki, Greece, in May 2007. The 10 revised full papers presented together with 9 invited papers were carefully reviewed and selected from 29 submissions. The papers cover topics such as algebraic semantics on graphs and trees, formal power series, syntactic objects, algebraic picture processing, infinite computation, acceptors and transducers for strings, trees, graphs, arrays, etc., and decision problems.
