Formal Languages, Automata and Numeration Systems 2
Formal Languages, Automata and Numeration Systems 2

Author: Michel Rigo

Publisher: John Wiley & Sons

Published: 2014-09-10

Total Pages: 151

ISBN-13: 1119042860

DOWNLOAD EBOOK

The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from theoretical computer science and mathematics. Theoretical computer science offers here topics such as decision problems and recognizability issues, whereas mathematics offers concepts such as discrete dynamical systems. The main goal is to give a quick access, for students and researchers in mathematics or computer science, to actual research topics at the intersection between automata and formal language theory, number theory and combinatorics on words. The second of two volumes on this subject, this book covers regular languages, numeration systems, formal methods applied to decidability issues about infinite words and sets of numbers.

Formal Languages, Automata and Numeration Systems 1
Formal Languages, Automata and Numeration Systems 1

Author: Michel Rigo

Publisher: John Wiley & Sons

Published: 2014-11-17

Total Pages: 332

ISBN-13: 1848216157

DOWNLOAD EBOOK

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.

Substitution and Tiling Dynamics: Introduction to Self-inducing Structures
Substitution and Tiling Dynamics: Introduction to Self-inducing Structures

Author: Shigeki Akiyama

Publisher: Springer Nature

Published: 2020-12-05

Total Pages: 456

ISBN-13: 3030576663

DOWNLOAD EBOOK

This book presents a panorama of recent developments in the theory of tilings and related dynamical systems. It contains an expanded version of courses given in 2017 at the research school associated with the Jean-Morlet chair program. Tilings have been designed, used and studied for centuries in various contexts. This field grew significantly after the discovery of aperiodic self-similar tilings in the 60s, linked to the proof of the undecidability of the Domino problem, and was driven futher by Dan Shechtman's discovery of quasicrystals in 1984. Tiling problems establish a bridge between the mutually influential fields of geometry, dynamical systems, aperiodic order, computer science, number theory, algebra and logic. The main properties of tiling dynamical systems are covered, with expositions on recent results in self-similarity (and its generalizations, fusions rules and S-adic systems), algebraic developments connected to physics, games and undecidability questions, and the spectrum of substitution tilings.

Concepts and Semantics of Programming Languages 1
Concepts and Semantics of Programming Languages 1

Author: Therese Hardin

Publisher: John Wiley & Sons

Published: 2021-08-17

Total Pages: 338

ISBN-13: 1786305305

DOWNLOAD EBOOK

This book – the first of two volumes – explores the syntactical constructs of the most common programming languages, and sheds a mathematical light on their semantics, while also providing an accurate presentation of the material aspects that interfere with coding. Concepts and Semantics of Programming Languages 1 is dedicated to functional and imperative features. Included is the formal study of the semantics of typing and execution; their acquisition is facilitated by implementation into OCaml and Python, as well as by worked examples. Data representation is considered in detail: endianness, pointers, memory management, union types and pattern-matching, etc., with examples in OCaml, C and C++. The second volume introduces a specific model for studying modular and object features and uses this model to present Ada and OCaml modules, and subsequently Java, C++, OCaml and Python classes and objects. This book is intended not only for computer science students and teachers but also seasoned programmers, who will find a guide to reading reference manuals and the foundations of program verification.

Digital Transformation
Digital Transformation

Author: Jean-Louis Leignel

Publisher: John Wiley & Sons

Published: 2016-11-22

Total Pages: 130

ISBN-13: 1119377978

DOWNLOAD EBOOK

The main aim of this book is to offer companies a simple and practical method to assess their maturity in the Governance Information System, so that they are in working order to face the challenges of Digital Transformation. How can companies effectively manage their investment in IT systems and make the most of their development?

Evolutionary Algorithms
Evolutionary Algorithms

Author: Alain Petrowski

Publisher: John Wiley & Sons

Published: 2017-04-11

Total Pages: 214

ISBN-13: 1119136415

DOWNLOAD EBOOK

Evolutionary algorithms are bio-inspired algorithms based on Darwin’s theory of evolution. They are expected to provide non-optimal but good quality solutions to problems whose resolution is impracticable by exact methods. In six chapters, this book presents the essential knowledge required to efficiently implement evolutionary algorithms. Chapter 1 describes a generic evolutionary algorithm as well as the basic operators that compose it. Chapter 2 is devoted to the solving of continuous optimization problems, without constraint. Three leading approaches are described and compared on a set of test functions. Chapter 3 considers continuous optimization problems with constraints. Various approaches suitable for evolutionary methods are presented. Chapter 4 is related to combinatorial optimization. It provides a catalog of variation operators to deal with order-based problems. Chapter 5 introduces the basic notions required to understand the issue of multi-objective optimization and a variety of approaches for its application. Finally, Chapter 6 describes different approaches of genetic programming able to evolve computer programs in the context of machine learning.

Formal Languages, Automata and Numeration Systems 1
Formal Languages, Automata and Numeration Systems 1

Author: Michel Rigo

Publisher: John Wiley & Sons

Published: 2014-09-10

Total Pages: 330

ISBN-13: 1119008220

DOWNLOAD EBOOK

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.

NoSQL Data Models
NoSQL Data Models

Author: Olivier Pivert

Publisher: John Wiley & Sons

Published: 2018-07-30

Total Pages: 215

ISBN-13: 1119544149

DOWNLOAD EBOOK

The topic of NoSQL databases has recently emerged, to face the Big Data challenge, namely the ever increasing volume of data to be handled. It is now recognized that relational databases are not appropriate in this context, implying that new database models and techniques are needed. This book presents recent research works, covering the following basic aspects: semantic data management, graph databases, and big data management in cloud environments. The chapters in this book report on research about the evolution of basic concepts such as data models, query languages, and new challenges regarding implementation issues.

JavaScript and Open Data
JavaScript and Open Data

Author: Robert Jeansoulin

Publisher: John Wiley & Sons

Published: 2018-06-21

Total Pages: 209

ISBN-13: 1119527341

DOWNLOAD EBOOK

This book will teach you how to take advantage of the JavaScript language to process data provided on the Internet. Much attention is given to the main JavaScript backbone: prototype based objects, and functional capabilities, while common features (loops, etc.) are summarized in a few cheat-sheets. Only operational features are detailed through the coding of several applications -the second and largest part of the book-, on free-access datasets (e.g. World Bank). It includes: cartography (SVG or API's based), data-sheets access (via Ajax or Jsonp), video data and post-synchronization, and animation examples.

Evolutionary Computation with Biogeography-based Optimization
Evolutionary Computation with Biogeography-based Optimization

Author: Haiping Ma

Publisher: John Wiley & Sons

Published: 2017-01-18

Total Pages: 299

ISBN-13: 1119136512

DOWNLOAD EBOOK

Evolutionary computation algorithms are employed to minimize functions with large number of variables. Biogeography-based optimization (BBO) is an optimization algorithm that is based on the science of biogeography, which researches the migration patterns of species. These migration paradigms provide the main logic behind BBO. Due to the cross-disciplinary nature of the optimization problems, there is a need to develop multiple approaches to tackle them and to study the theoretical reasoning behind their performance. This book explains the mathematical model of BBO algorithm and its variants created to cope with continuous domain problems (with and without constraints) and combinatorial problems.