You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the 13th International Conference on Combinatorics on Words, WORDS 2021, held virtually in September 2021. The 14 revised full papers presented in this book together with 2 invited talks were carefully reviewed and selected from 18 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc.
This book constitutes the refereed proceedings of the Second International Conference on Language and Automata Theory and Applications, LATA 2008, held in Tarragona, Spain, in March 2008. The 40 revised full papers presented were carefully reviewed and selected from 134 submissions. The papers deal with the various issues related to automata theory and formal languages
This book constitutes the refereed proceedings of the 11th International Conference on Combinatorics on Words, WORDS 2017, held in Montréal, QC, Canada, in September 2017. The 21 revised full papers presented together with 5invoted talks were carefully reviewed and selected from 26 submissions. Discrete geometry plays an expanding role in the fields of shape modeling, image synthesis, and image analysis. It deals with topological and geometrical definitions of digitized objects or digitized images and provides both a theoretical and computational framework for computer imaging.
This book constitutes the refereed proceedings of the 10th International Conference on Combinatorics on Words, WORDS 2015, held in Kiel, Germany, in September 2015 under the auspices of the EATCS. The 14 revised full papers presented were carefully reviewed and selected from 22 submissions. The main object in the contributions are words, finite or infinite sequences of symbols over a finite alphabet. The papers reflect both theoretical contributions related to combinatorial, algebraic, and algorithmic aspects of words, as well as to contributions presenting applications of the theory of words in other field of computer science, linguistics, biology, bioinformatics, or physics.
What is order that is not based on simple repetition, that is, periodicity? How must atoms be arranged in a material so that it diffracts like a quasicrystal? How can we describe aperiodically ordered systems mathematically? Originally triggered by the – later Nobel prize-winning – discovery of quasicrystals, the investigation of aperiodic order has since become a well-established and rapidly evolving field of mathematical research with close ties to a surprising variety of branches of mathematics and physics. This book offers an overview of the state of the art in the field of aperiodic order, presented in carefully selected authoritative surveys. It is intended for non-experts with a general background in mathematics, theoretical physics or computer science, and offers a highly accessible source of first-hand information for all those interested in this rich and exciting field. Topics covered include the mathematical theory of diffraction, the dynamical systems of tilings or Delone sets, their cohomology and non-commutative geometry, the Pisot substitution conjecture, aperiodic Schrödinger operators, and connections to arithmetic number theory.
This two volume set LNCS 8634 and LNCS 8635 constitutes the refereed conference proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Programming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games.
This book constitutes the proceedings of the 18th International Conference on Developments in Language Theory, DLT 2014, held in Ekaterinburg, Russia, in August 2014. The 22 full papers and 5 short papers presented together with 3 invited talks were carefully reviewed and selected from 38 submissions. The papers are organized in topical subjects on 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 and Quantum Computing.
This book constitutes the refereed proceedings of the 14th Latin American Symposium on Theoretical Informatics, LATIN 2020, held in Sao Paulo, Brazil, in January 2021. The 50 full papers presented in this book were carefully reviewed and selected from 136 submissions. The papers are grouped into these topics: approximation algorithms; parameterized algorithms; algorithms and data structures; computational geometry; complexity theory; quantum computing; neural networks and biologically inspired computing; randomization; combinatorics; analytic and enumerative combinatorics; graph theory. Due to the Corona pandemic the event was postponed from May 2020 to January 2021.
This book constitutes the refereed proceedings of the 16th International Conference on Developments in Language Theory, DLT 2012, held in Taipei, Taiwan, in August 2012. The 34 regular papers presented were carefully reviewed and selected from numerous submissions. The volume also contains the papers or extended abstracts of 4 invited lectures, as well as a special memorial presentation in honor of Sheng Yu. The topics covered include 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.