Word Equations and Related Topics

Word Equations and Related Topics PDF

Author: Klaus U. Schulz

Publisher: Springer Science & Business Media

Published: 1992-01-29

Total Pages: 278

ISBN-13: 9783540551249

DOWNLOAD EBOOK →

This volume contains papers presented at the first international workshop onword equations and related topics held at the University of T}bingen in October 1990. Word equations, the central topic of this annual workshop, lieat the intersection of several important areas of computer science, suchas unification theory, combinatorics on words, list processing, and constraint logic programming. The workshop is a forum where researchers fromthese different domains may present and discuss results and ideas, thereby supporting interaction and cross-fertilization between theoretical questions and practical applications. The volume collects papers which: - contain new and relevant results, - describe a new approach to a subject, or - give a survey of main developments in an area. Papers cover investigations on free groups, associative unification and Makanin's algorithm to decide the solvability of equations in free semigroups, general unification theory and its relationship to algebra and model theory, Thue systems, and finitely presented groups.

Word Equations and Related Topics

Word Equations and Related Topics PDF

Author: Habib Abdulrab

Publisher: Springer Science & Business Media

Published: 1993-06-29

Total Pages: 228

ISBN-13: 9783540567301

DOWNLOAD EBOOK →

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.

Inclusion of Pattern Languages and Related Problems

Inclusion of Pattern Languages and Related Problems PDF

Author: Dominik Freydenberger

Publisher: Logos Verlag Berlin GmbH

Published: 2012

Total Pages: 167

ISBN-13: 3832530711

DOWNLOAD EBOOK →

A pattern is a word that consists of variables and terminal symbols. The pattern language that is generated by a pattern A is the set of all terminal words that can be obtained from A by uniform replacement of variables with terminal words. For example, the pattern A = xaxa (where x is a variable, and a is a terminal symbol) generates the set of all squares that end on a. Due to their simple definition, pattern languages have various connections to a wide range of other areas in computer science and mathematics. On the other hand, many of the canonical questions are surprisingly difficult for pattern languages. The present thesis discusses various aspects of the inclusion problem of pattern languages. It can be divided in two parts. The first one examines the decidability of the inclusion problem under various restrictions, and the related question of minimizability of regular expressions with repetition operators. The second part deals with descriptive patterns, the smallest generalizations of arbitrary languages through pattern languages ("smallest" with respect to the inclusion relation). Main topics are the existence and the discoverability of descriptive patterns.

STACS 99

STACS 99 PDF

Author: Christoph Meinel

Publisher: Springer

Published: 2003-05-21

Total Pages: 597

ISBN-13: 3540491163

DOWNLOAD EBOOK →

This book constitutes the refereed proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 99, held in Trier, Germany in March 1999. The 51 revised full papers presented were selected from a total of 146 submissions. Also included are three invited papers. The volume is divided in topical sections on complexity, parallel algorithms, computational geometry, algorithms and data structures, automata and formal languages, verification, algorithmic learning, and logic in computer science.

Words, Languages, and Combinatorics Three

Words, Languages, and Combinatorics Three PDF

Author: Masami It?

Publisher: World Scientific

Published: 2003

Total Pages: 503

ISBN-13: 9810249489

DOWNLOAD EBOOK →

The research results published in this book range from pure mathematical theory (semigroup theory, discrete mathematics, etc.) to theoretical computer science, in particular formal languages and automata. The papers address issues in the algebraic and combinatorial theories of semigroups, words and languages, the structure theory of automata, the classification theory of formal languages and codes, and applications of these theories to various areas, like quantum and molecular computing, coding theory, and cryptography.

Algebraic Combinatorics on Words

Algebraic Combinatorics on Words PDF

Author: M. Lothaire

Publisher: Cambridge University Press

Published: 2002-04-18

Total Pages: 536

ISBN-13: 9780521812207

DOWNLOAD EBOOK →

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

Combinatorics on Words

Combinatorics on Words PDF

Author: Anna Frid

Publisher: Springer Nature

Published: 2023-05-30

Total Pages: 310

ISBN-13: 303133180X

DOWNLOAD EBOOK →

This book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, Sweden, during June 12–16, 2023. The 19 contributed papers presented in this book were carefully reviewed and selected from 28 submissions. In addition, the volume also contains 3 invited papers. WORDS is the main conference series devoted to combinatorics on words. This area is connected to several topics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatorics

Developments in Language Theory

Developments in Language Theory PDF

Author: Volker Diekert

Publisher: Springer Nature

Published: 2022-05-08

Total Pages: 339

ISBN-13: 3031055780

DOWNLOAD EBOOK →

This book constitutes the proceedings of the 26th International Conference on Developments in Language Theory, DLT 2022, which was held in Tampa, FL, USA, during May, 2022. The conference took place in an hybrid format with both in-person and online participation. The 21 full papers included in these proceedings were carefully reviewed and selected from 32 submissions. The DLT conference series provides a forum for presenting current developments in formal languages and automata.