Jean Berstel's Books

Automatic Sequences

Theory, Applications, Generalizations

By: Jean-Paul Allouche,Jeffrey Shallit

Write a review Read reviews Take a Quiz Solve Book Puzzle

Automatic Sequences

Theory, Applications, Generalizations

By: Jean-Paul Allouche,Jeffrey Shallit

Uniting dozens of seemingly disparate results from different fields, this book combines concepts from mathematics and computer science to present the first integrated treatment of sequences generated by 'finite automata'. The authors apply the theory to the study of automatic sequences and their generalizations, such as Sturmian words and k-regular sequences. And further, they provide applications to number theory (particularly to formal power series and transcendence in finite characteristic), physics, computer graphics, and music. Starting from first principles wherever feasible, basic results from combinatorics on words, numeration systems, and models of computation are discussed. Thus this book is suitable for graduate students or advanced undergraduates, as well as for mature researchers wishing to know more about this fascinating subject. Results are presented from first principles wherever feasible, and the book is supplemented by a collection of 460 exercises, 85 open problems, and over 1600 citations to the literature.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

592

Publisher

Cambridge University Press

Published Date

ISBN 10

0521823323

ISBN 13

9780521823326

Noncommutative Rational Series with Applications

By: Jean Berstel,Christophe Reutenauer

Write a review Read reviews Take a Quiz Solve Book Puzzle

Noncommutative Rational Series with Applications

By: Jean Berstel,Christophe Reutenauer

A modern account of the subject and its applications. Excellent resource for those working in algebra and theoretical computer science.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

263

Publisher

Cambridge University Press

Published Date

ISBN 10

0521190223

ISBN 13

9780521190220

Codes and Automata

By: Jean Berstel,Dominique Perrin,Christophe Reutenauer

Write a review Read reviews Take a Quiz Solve Book Puzzle

Codes and Automata

By: Jean Berstel,Dominique Perrin,Christophe Reutenauer

This major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The concept of unambiguous automata, which is intimately linked with that of codes, now plays a significant role throughout the book, reflecting developments of the last 20 years. This is complemented by a discussion of the connection between codes and automata, and new material from the field of symbolic dynamics. The authors have also explored links with more practical applications, including data compression and cryptography. The treatment remains self-contained: there is background material on discrete mathematics, algebra and theoretical computer science. The wealth of exercises and examples make it ideal for self-study or courses. In summary, this is a comprehensive reference on the theory of variable-length codes and their relation to automata.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

634

Publisher

Cambridge University Press

Published Date

ISBN 10

052188831X

ISBN 13

9780521888318

Term Rewriting

French Spring School of Theoretical Computer Science, Font Romeux, France, 17 - 21, 1993. Advanced Course

By: Hubert Comon,Jean-Pierre Jouannaud

Write a review Read reviews Take a Quiz Solve Book Puzzle

Term Rewriting

French Spring School of Theoretical Computer Science, Font Romeux, France, 17 - 21, 1993. Advanced Course

By: Hubert Comon,Jean-Pierre Jouannaud

This volume contains thoroughly revised versions of the contributions presented at the French Spring School of Theoretical Computer Science, held in Font Romeu, France in May 1993. This seminar was devoted to rewriting in a broad sense, as rewriting is now an important discipline, relating to many other areas such as formal languages, models of concurrency, tree automata, functional programming languages, constraints, symbolic computation, and automated deduction. The book includes a number of surveys contributed by senior researchers as well as a few papers presenting original research of relevance for the broader theoretical computer science community.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

236

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540593403

ISBN 13

9783540593409

CIAA 2003

By: Jean-Marc Champarnaud

Write a review Read reviews Take a Quiz Solve Book Puzzle

CIAA 2003

By: Jean-Marc Champarnaud

The 7th International Conference on Implementation and Application of Au- mata (CIAA 2002) was held at the Universit ́ e Fran ̧ cois Rabelais of Tours, in Tours, France, on July 3–5, 2002. This volume of Lecture Notes in Computer Science contains all the papers that were presented at CIAA 2002, as well as the abstracts of the poster papers that were displayed during the conference. The conference addressed issues in automata application and implemen- tion. Thetopicsofthepaperspresentedinthisconferencerangedfromautomata applications in software engineering, natural language and speech recognition, and image processing, to new representations and algorithms for e?cient imp- mentation of automata and related structures. Automata theory is one of the oldest areas in computer science. Research in automata theory has always been motivated by its applications since its early stage of development. In the 1960s and 1970s, automata research was motivated heavily by problems arising from compiler construction, circuit design, string matching, etc. In recent years, many new applications of automata have been found in various areas of computer science as well as in other disciplines. - amples of the new applications include statecharts in object-oriented modeling, ?nite transducers in natural language processing, and nondeterministic ?ni- state models in communication protocols. Many of the new applications cannot simply utilize the existing models and algorithms in automata theory in the - lution to their problems. New models, or modi?cations of the existing models, are needed to satisfy their requirements.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

318

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540403914

ISBN 13

9783540403913

Semigroups, Algorithms, Automata, and Languages

Coimbra, Portugal, May-July 2001

By: Gracinda M. S. Gomes,Jean Eric Pin,Pedro V. Silva

Write a review Read reviews Take a Quiz Solve Book Puzzle

Semigroups, Algorithms, Automata, and Languages

Coimbra, Portugal, May-July 2001

By: Gracinda M. S. Gomes,Jean Eric Pin,Pedro V. Silva

The thematic term on ?Semigroups, Algorithms, Automata and Languages? organized at the International Centre of Mathematics (Coimbra, Portugal) in May-July 2001 was the gathering point for researchers working in the field of semigroups, algorithms, automata and languages. These areas were selected considering their huge recent developments, their potential applications, and the motivation from other fields of mathematics and computer science.This proceedings volume is a unique collection of advanced courses and original contributions on semigroups and their connections with logic, automata, languages, group theory, discrete dynamics, topology and complexity. A selection of open problems discussed during the thematic term is also included.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

526

Publisher

World Scientific

Published Date

ISBN 10

981238099X

ISBN 13

9789812380999

Formal Properties of Finite Automata and Applications

LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988. Proceedings

By: Jean E. Pin

Write a review Read reviews Take a Quiz Solve Book Puzzle

Formal Properties of Finite Automata and Applications

LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988. Proceedings

By: Jean E. Pin

The volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years on the mathematical foundations form the first part of the book. The second part is devoted to the important problems of the theory including star-height, concatenation hierarchies, and connections with logic and word problems. The last part presents a large variety of possible applications: number theory, distributed systems, algorithms on strings, theory of codes, complexity of boolean circuits and others.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

276

Publisher

Springer Science & Business Media

Published Date

ISBN 10

354051631X

ISBN 13

9783540516316

Noncommutative Rational Series with Applications

By: Jean Berstel,Christophe Reutenauer

Write a review Read reviews Take a Quiz Solve Book Puzzle

Noncommutative Rational Series with Applications

By: Jean Berstel,Christophe Reutenauer

A modern account of the subject and its applications. Excellent resource for those working in algebra and theoretical computer science.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

263

Publisher

Cambridge University Press

Published Date

ISBN 10

0521190223

ISBN 13

9780521190220

Automata Implementation

Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers

By: Jean-Marc Champarnaud

Write a review Read reviews Take a Quiz Solve Book Puzzle

Automata Implementation

Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers

By: Jean-Marc Champarnaud

This book constitutes the thoroughly refereed post-workshop proceedings of the Third International Workshop on Implementing Automata, WIA'98, held in Rouen, France, in September 1998. The 21 revised full papers presented were carefully selected from the workshop contributions after several rounds of reviewing. The papers are devoted to issues of implementing automata of various types important for areas such as parsing, computational linguistics, speech recognition, text searching, device controlers, distributed systems, and protocol analysis.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

254

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540666524

ISBN 13

9783540666523

Word Equations and Related Topics

Second International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991. Proceedings

By: Habib Abdulrab,Jean-Pierre Pecuchet

Write a review Read reviews Take a Quiz Solve Book Puzzle

Word Equations and Related Topics

Second International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991. Proceedings

By: Habib Abdulrab,Jean-Pierre Pecuchet

This volume contains papers presented at the second International Workshop on Word Equations and Related Topics (IWWERT '91), held at the University ofRouen in October 1991. The papers are on the following topics: general solution of word equations, conjugacy in free inverse monoids, general A- and AX-unification via optimized combination procedures, wordequations with two variables, a conjecture about conjugacy in free groups, acase of termination for associative unification, theorem proving by combinatorial optimization, solving string equations with constant restriction, LOP (toward a new implementation of Makanin's algorithm), word unification and transformation of generalizedequations, unification in the combination of disjoint theories, on the subsets of rank two in a free monoid (a fast decision algorithm), and a solution of the complement problem in associative-commutative theories.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

228

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540567305

ISBN 13

9783540567301

CAAP '92

17th Colloquium on Trees in Algebra and Programming Rennes, France, February 26-28, 1992. Proceedings

By: Jean-Claude Raoult

Write a review Read reviews Take a Quiz Solve Book Puzzle

CAAP '92

17th Colloquium on Trees in Algebra and Programming Rennes, France, February 26-28, 1992. Proceedings

By: Jean-Claude Raoult

This volume contains selected papers presented at the seventeenth Colloquiumon Trees in Algebra and Programming (CAAP) held jointly with the European Symposium on Programming (ESOP) in Rennes, France, February 26-28, 1992 (the proceedings of ESOP appear in LNCS 582). The previous colloquia were held in France, Italy, Germany, Spain, Denmark and England. Every even year, as in 1992, CAAP is held jointly with ESOP; every other year, it is part of TAPSOFT (Theory And Practice of SOFTware development). In the beginning, CAAP was devoted to algebraic and combinatorial properties of trees and their role in various fields of computer science. The scope of CAAP has now been extended to other discrete structures, like graphs, equations and transformations of graphs, and their links with logical theories. The programme committee received 40 submissions, from which 19 papers have been selected for inclusion inthis volume.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

376

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540552510

ISBN 13

9783540552512

La Formule des Traces Tordue d'apres le Friday Morning Seminar

By: Jean-Pierre Labesse,Jean-Loup Waldspurger

Write a review Read reviews Take a Quiz Solve Book Puzzle

La Formule des Traces Tordue d'apres le Friday Morning Seminar

By: Jean-Pierre Labesse,Jean-Loup Waldspurger

La formule des traces pour un groupe reductif connexe arbitraire est due a James Arthur. Le cas tordu a fait l'objet du Friday Morning Seminar a l'Institute for Advanced Study de Princeton pendant l'annee academique 1983-1984. Lors de ce seminaire, des ex

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

264

Publisher

American Mathematical Soc.

Published Date

ISBN 10

0821894412

ISBN 13

9780821894415

Infinite Words

Automata, Semigroups, Logic and Games

By: Dominique Perrin,Jean-Éric Pin

Write a review Read reviews Take a Quiz Solve Book Puzzle

Infinite Words

Automata, Semigroups, Logic and Games

By: Dominique Perrin,Jean-Éric Pin

Infinite Words is an important theory in both Mathematics and Computer Sciences. Many new developments have been made in the field, encouraged by its application to problems in computer science. Infinite Words is the first manual devoted to this topic. Infinite Words explores all aspects of the theory, including Automata, Semigroups, Topology, Games, Logic, Bi-infinite Words, Infinite Trees and Finite Words. The book also looks at the early pioneering work of Büchi, McNaughton and Schützenberger. Serves as both an introduction to the field and as a reference book. Contains numerous exercises desgined to aid students and readers. Self-contained chapters provide helpful guidance for lectures.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

560

Publisher

Academic Press

Published Date

ISBN 10

0125321112

ISBN 13

9780125321112

Developmental SystemS

At the Crossroads of System Theory, Computer Science, and Genetic Engineering

By: Stefan Wegrzyn,Jean-Charles Gille,Pierre Vidal

Write a review Read reviews Take a Quiz Solve Book Puzzle

Developmental SystemS

At the Crossroads of System Theory, Computer Science, and Genetic Engineering

By: Stefan Wegrzyn,Jean-Charles Gille,Pierre Vidal

Many facts were at the origin of the present monograph. The ftrst is the beauty of maple leaves in Quebec forests in Fall. It raised the question: how does nature create and reproduce such beautiful patterns? The second was the reading of A. Lindenmayer's works on L systems. Finally came the discovery of "the secrets of DNA" together with many stimulating ex changes with biologists. Looking at such facts from the viewpoint of recursive numerical systems led to devise a simple model based on six elementary operations organized in a generating word, the analog of the program of a computer and of the genetic code of DNA in the cells of a living organism. It turned out that such a model, despite its simplicity, can account for a great number of properties of living organisms, e.g. their hierarchical structure, their ability to regenerate after a trauma, the possibility of cloning, their sensitivity to mutation, their growth, decay and reproduction. The model lends itself to analysis: the knowledge of the generating word makes it possible to predict the structure of the successive developmental stages of the system; and to synthesis: a speciftc type of structure can be obtained by systematically constructing a generating word that produces it. In fact the model here proposed is coherent with the fundamental assumptions of cellular biology and in particular with recent discoveries concerning DNA, which in the light of our model behaves like a very elaborate generating word.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

129

Publisher

Springer Science & Business Media

Published Date

ISBN 10

1461234387

ISBN 13

9781461234388

Algorithmic Geometry

By: Jean-Daniel Boissonnat,Mariette Yvinec

Write a review Read reviews Take a Quiz Solve Book Puzzle

Algorithmic Geometry

By: Jean-Daniel Boissonnat,Mariette Yvinec

The design and analysis of geometric algorithms have seen remarkable growth in recent years, due to their application in, for example, computer vision, graphics, medical imaging and CAD. The goals of this book are twofold: first to provide a coherent and systematic treatment of the foundations; secondly to present algorithmic solutions that are amenable to rigorous analysis and are efficient in practical situations. When possible, the algorithms are presented in their most general d-dimensional setting. Specific developments are given for the 2- or 3-dimensional cases when this results in significant improvements. The presentation is confined to Euclidean affine geometry, though the authors indicate whenever the treatment can be extended to curves and surfaces. The prerequisites for using the book are few, which will make it ideal for teaching advanced undergraduate or beginning graduate courses in computational geometry.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

548

Publisher

Cambridge University Press

Published Date

ISBN 10

0521565294

ISBN 13

9780521565295

A Pyramid Framework for Early Vision

Multiresolutional Computer Vision

By: Jean-Michel Jolion,Azriel Rosenfeld

Write a review Read reviews Take a Quiz Solve Book Puzzle

A Pyramid Framework for Early Vision

Multiresolutional Computer Vision

By: Jean-Michel Jolion,Azriel Rosenfeld

Biological visual systems employ massively parallel processing to perform real-world visual tasks in real time. A key to this remarkable performance seems to be that biological systems construct representations of their visual image data at multiple scales. A Pyramid Framework for Early Vision describes a multiscale, or `pyramid', approach to vision, including its theoretical foundations, a set of pyramid-based modules for image processing, object detection, texture discrimination, contour detection and processing, feature detection and description, and motion detection and tracking. It also shows how these modules can be implemented very efficiently on hypercube-connected processor networks. A Pyramid Framework for Early Vision is intended for both students of vision and vision system designers; it provides a general approach to vision systems design as well as a set of robust, efficient vision modules.

Average ratings

N/A