Mathematics

Codes and Automata

Author: Jean Berstel,Dominique Perrin,Christophe Reutenauer

Publisher: Cambridge University Press

ISBN: 052188831X

Category: Mathematics

Page: 619

View: 4653

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

Combinatorics, Automata and Number Theory

Author: Valérie Berthé,Michel Rigo

Publisher: Cambridge University Press

ISBN: 0521515971

Category: Mathematics

Page: 615

View: 5103

This series is devoted to significant topics or themes that have wide application in mathematics or mathematical science and for which a detailed development of the abstract theory is less important than a thorough and concrete exploration of the implications and applications. Books in the Encyclopedia of Mathematics and its Applications cover their subjects comprehensively. Less important results may be summarised as exercises at the ends of chapters, For technicalities, readers can be referred to the bibliography, which is expected to be comprehensive. As a result, volumes are encyclopedic references or manageable guides to major subjects.
Mathematics

Algebraic Combinatorics on Words

Author: M. Lothaire

Publisher: Cambridge University Press

ISBN: 9780521812207

Category: Mathematics

Page: 504

View: 3811

Comprehensive 2002 introduction to combinatorics on words for mathematicians and theoretical computer scientists.
Computers

Implementation and Application of Automata

18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings

Author: Saint Mary's University Department of Mathematics

Publisher: Springer

ISBN: 3642392741

Category: Computers

Page: 358

View: 3722

This book constitutes the thoroughly refereed papers of the 18th International Conference on Implementation and Application of Automata, CIAA 2013, held in Halifax, NS, Canada, in July 2013. The 25 revised full papers presented together with 3 invited papers and 7 short papers were carefully selected from 43 submissions. The papers cover various topics such as complexity of automata; compressed automata; counter automata; dictionary matching; edit distance; homing sequences; implementation; minimization of automata; model checking; parsing of regular expressions; partial word automata; picture languages; pushdown automata; queue automata; reachability analysis for software verification; restarting automata; transducers; tree automata; weighted automata; XML streams.
Computers

Relational Mathematics

Author: Gunther Schmidt

Publisher: Cambridge University Press

ISBN: 0521762685

Category: Computers

Page: 567

View: 6181

A modern, comprehensive 2010 overview providing an easy introduction for applied scientists who are not versed in mathematics.
Computers

Language and Automata Theory and Applications

10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings

Author: Adrian-Horia Dediu,Jan Janoušek,Carlos Martín-Vide,Bianca Truthe

Publisher: Springer

ISBN: 3319300008

Category: Computers

Page: 618

View: 5718

This book constitutes the refereed proceedings of the 10th International Conference on Language and Automata Theory and Applications, LATA 2016, held in Prague, Czech Republic, in March 2016. The 42 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 119 submissions. The papers cover the following topics: algebraic language theory; algorithms for semi-structured data mining, algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata networks, concurrency and Petri nets; automatic structures; cellular automata, codes, combinatorics on words; computational complexity; data and image compression; descriptional complexity; digital libraries and document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; parallel and regulated rewriting; parsing; patterns; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.
Mathematics

Permanents

Author: Henryk Minc

Publisher: Cambridge University Press

ISBN: 9780521302265

Category: Mathematics

Page: 224

View: 2503

The purpose of this book, which was first published in 1978, is to give a complete account of the theory of permanents, their history and applications. This volume was the first complete account of the theory of permanents, covering virtually the whole of the subject, a feature that no simple survey of the theory of matrices can even attempt. The work also contains many results stated without formal proofs. This book can be used as a textbook at the advanced undergraduate or graduate level. The only prerequisites are a standard undergraduate course in the theory of matrices and a measure of mathematical maturity.
Mathematics

Computation with Finitely Presented Groups

Author: Charles C. Sims

Publisher: Cambridge University Press

ISBN: 9780521432139

Category: Mathematics

Page: 604

View: 8460

Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theoretical computer scientists will find this book useful.
Mathematics

Introduction to the Modern Theory of Dynamical Systems

Author: Anatole Katok,Boris Hasselblatt

Publisher: Cambridge University Press

ISBN: 9780521575577

Category: Mathematics

Page: 802

View: 4011

This book provides a self-contained comprehensive exposition of the theory of dynamical systems. The book begins with a discussion of several elementary but crucial examples. These are used to formulate a program for the general study of asymptotic properties and to introduce the principal theoretical concepts and methods. The main theme of the second part of the book is the interplay between local analysis near individual orbits and the global complexity of the orbit structure. The third and fourth parts develop the theories of low-dimensional dynamical systems and hyperbolic dynamical systems in depth. The book is aimed at students and researchers in mathematics at all levels from advanced undergraduate and up.
Mathematics

Matroid Applications

Author: Neil White

Publisher: Cambridge University Press

ISBN: 9780521381659

Category: Mathematics

Page: 363

View: 2500

This volume, the third in a sequence that began with The Theory of Matroids and Combinatorial Geometries, concentrates on the applications of matroid theory to a variety of topics from engineering (rigidity and scene analysis), combinatorics (graphs, lattices, codes and designs), topology and operations research (the greedy algorithm).
Mathematics

Theory of Matroids

Author: Neil White

Publisher: Cambridge University Press

ISBN: 0521309379

Category: Mathematics

Page: 316

View: 4746

The theory of matroids is unique in the extent to which it connects such disparate branches of combinatorial theory and algebra as graph theory, lattice theory, design theory, combinatorial optimization, linear algebra, group theory, ring theory and field theory. Furthermore, matroid theory is alone among mathematical theories because of the number and variety of its equivalent axiom systems. Indeed, matroids are amazingly versatile and the approaches to the subject are varied and numerous. This book is a primer in the basic axioms and constructions of matroids. The contributions by various leaders in the field include chapters on axiom systems, lattices, basis exchange properties, orthogonality, graphs and networks, constructions, maps, semi-modular functions and an appendix on cryptomorphisms. The authors have concentrated on giving a lucid exposition of the individual topics; explanations of theorems are preferred to complete proofs and original work is thoroughly referenced. In addition, exercises are included for each topic.
Mathematics

Computation and Automata

Author: Arto Salomaa

Publisher: Cambridge University Press

ISBN: 9780521302456

Category: Mathematics

Page: 284

View: 8962

In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography.
Mathematics

Noncommutative Rational Series with Applications

Author: Jean Berstel,Christophe Reutenauer

Publisher: Cambridge University Press

ISBN: 0521190223

Category: Mathematics

Page: 248

View: 6865

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

Model Theory

Author: Wilfrid Hodges

Publisher: Cambridge University Press

ISBN: 9780521304429

Category: Mathematics

Page: 772

View: 1074

Model theory is concerned with the notions of definition, interpretation and structure in a very general setting, and is applied to a wide range of other areas such as set theory, geometry, algebra and computer science. This book provides an integrated introduction to model theory for graduate students.
Computers

Formal Languages, Automata and Numeration Systems

Author: Michel Rigo

Publisher: John Wiley & Sons

ISBN: 1119008220

Category: Computers

Page: 338

View: 5434

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). Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns. When considering some numeration systems, any integer can be represented as a finite word over an alphabet of digits. This simple observation leads to the study of the relationship between the arithmetical properties of the integers and the syntactical properties of the corresponding representations. One of the most profound results in this direction is given by the celebrated theorem by Cobham. Surprisingly, a recent extension of this result to complex numbers led to the famous Four Exponentials Conjecture. This is just one example of the fruitful relationship between formal language theory (including the theory of automata) and number theory. Contents to include: • algebraic structures, homomorphisms, relations, free monoid • finite words, prefixes, suffixes, factors, palindromes • periodicity and Fine–Wilf theorem • infinite words are sequences over a finite alphabet • properties of an ultrametric distance, example of the p-adic norm • topology of the set of infinite words • converging sequences of infinite and finite words, compactness argument • iterated morphism, coding, substitutive or morphic words • the typical example of the Thue–Morse word • the Fibonacci word, the Mex operator, the n-bonacci words • wordscomingfromnumbertheory(baseexpansions,continuedfractions,...) • the taxonomy of Lindenmayer systems • S-adic sequences, Kolakoski word • repetition in words, avoiding repetition, repetition threshold • (complete) de Bruijn graphs • concepts from computability theory and decidability issues • Post correspondence problem and application to mortality of matrices • origins of combinatorics on words • bibliographic notes • languages of finite words, regular languages • factorial, prefix/suffix closed languages, trees and codes • unambiguous and deterministic automata, Kleene’s theorem • growth function of regular languages • non-deterministic automata and determinization • radix order, first word of each length and decimation of a regular language • the theory of the minimal automata • an introduction to algebraic automata theory, the syntactic monoid and the syntactic complexity • star-free languages and a theorem of Schu ̈tzenberger • rational formal series and weighted automata • context-free languages, pushdown automata and grammars • growth function of context-free languages, Parikh’s theorem • some decidable and undecidable problems in formal language theory • bibliographic notes • factor complexity, Morse–Hedlund theorem • arithmetic complexity, Van Der Waerden theorem, pattern complexity • recurrence, uniform recurrence, return words • Sturmian words, coding of rotations, Kronecker’s theorem • frequencies of letters, factors and primitive morphism • critical exponent • factor complexity of automatic sequences • factor complexity of purely morphic sequences • primitive words, conjugacy, Lyndon word • abelianisation and abelian complexity • bibliographic notes • automatic sequences, equivalent definitions • a theorem of Cobham, equivalence of automatic sequences with constant length morphic sequences • a few examples of well-known automatic sequences • about Derksen’s theorem • some morphic sequences are not automatic • abstract numeration system and S-automatic sequences • k − ∞-automatic sequences • bibliographic notes • numeration systems, greedy algorithm • positional numeration systems, recognizable sets of integers • divisibility criterion and recognizability of N • properties of k-recognizable sets of integers, ratio and difference of consec- utive elements: syndeticity • integer base and Cobham’s theorem on the base dependence of the recog- nizability • non-standard numeration systems based on sequence of integers • linear recurrent sequences, Loraud and Hollander results • Frougny’s normalization result and addition • morphic numeration systems/sets of integers whose characteristic sequence is morphic • towards a generalization of Cobham’s theorem • a few words on the representation of real numbers, β-integers, finiteness properties • automata associated with Parry numbers and numeration systems • bibliographic notes First order logic • Presburger arithmetic and decidable theory • Muchnik’s characterization of semi-linear sets • Bu ̈chi’s theorem: k-recognizable sets are k-definable • extension to Pisot numeration systems • extension to real numbers • decidability issues for numeration systems • applications in combinatorics on words
Mathematics

Aperiodic Order: Volume 1, A Mathematical Invitation

Author: Michael Baake,Uwe Grimm

Publisher: Cambridge University Press

ISBN: 1316184382

Category: Mathematics

Page: N.A

View: 589

Quasicrystals are non-periodic solids that were discovered in 1982 by Dan Shechtman, Nobel Prize Laureate in Chemistry 2011. The underlying mathematics, known as the theory of aperiodic order, is the subject of this comprehensive multi-volume series. This first volume provides a graduate-level introduction to the many facets of this relatively new area of mathematics. Special attention is given to methods from algebra, discrete geometry and harmonic analysis, while the main focus is on topics motivated by physics and crystallography. In particular, the authors provide a systematic exposition of the mathematical theory of kinematic diffraction. Numerous illustrations and worked-out examples help the reader to bridge the gap between theory and application. The authors also point to more advanced topics to show how the theory interacts with other areas of pure and applied mathematics.
Technology & Engineering

Introduction to Convolutional Codes with Applications

Author: Ajay Dholakia

Publisher: Springer Science & Business Media

ISBN: 1461527120

Category: Technology & Engineering

Page: 242

View: 6625

Introduction to Convolutional Codes with Applications is an introduction to the basic concepts of convolutional codes, their structure and classification, various error correction and decoding techniques for convolutionally encoded data, and some of the most common applications. The definition and representations, distance properties, and important classes of convolutional codes are also discussed in detail. The book provides the first comprehensive description of table-driven correction and decoding of convolutionally encoded data. Complete examples of Viterbi, sequential, and majority-logic decoding technique are also included, allowing a quick comparison among the different decoding approaches. Introduction to Convolutional Codes with Applications summarizes the research of the last two decades on applications of convolutional codes in hybrid ARQ protocols. A new classification allows a natural way of studying the underlying concepts of hybrid schemes and accommodates all of the new research. A novel application of fast decodable invertible convolutional codes for lost packet recovery in high speed networks is described. This opens the door for using convolutional coding for error recovery in high speed networks. Practicing communications, electronics, and networking engineers who want to get a better grasp of the underlying concepts of convolutional coding and its applications will greatly benefit by the simple and concise style of explanation. An up-to-date bibliography of over 300 papers is included. Also suitable for use as a textbook or a reference text in an advanced course on coding theory with emphasis on convolutional codes.
Mathematics

Combinatorics on Words

Author: M. Lothaire

Publisher: Cambridge University Press

ISBN: 9780521599245

Category: Mathematics

Page: 238

View: 7992

This classic volume presents a thorough treatment of the theory of combinatorics on words.
Science

New Kind of Science

Notes from the Book

Author: Stephen Wolfram

Publisher: N.A

ISBN: 9781579550196

Category: Science

Page: 348

View: 845

Mathematics

Applied Abstract Algebra

Author: Rudolf Lidl,Günter Pilz

Publisher: Springer Science & Business Media

ISBN: 1475729413

Category: Mathematics

Page: 488

View: 9364

Accessible to junior and senior undergraduate students, this survey contains many examples, solved exercises, sets of problems, and parts of abstract algebra of use in many other areas of discrete mathematics. Although this is a mathematics book, the authors have made great efforts to address the needs of users employing the techniques discussed. Fully worked out computational examples are backed by more than 500 exercises throughout the 40 sections. This new edition includes a new chapter on cryptology, and an enlarged chapter on applications of groups, while an extensive chapter has been added to survey other applications not included in the first edition. The book assumes knowledge of the material covered in a course on linear algebra and, preferably, a first course in (abstract) algebra covering the basics of groups, rings, and fields.