Inclusion of Pattern Languages and Related Problems

Dominik D. Freydenberger

ISBN 978-3-8325-3071-6
167 pages, year of publication: 2012
price: 35.50 €
Inclusion of Pattern Languages and Related Problems
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.

cover cover cover cover cover cover cover cover cover
  • Patternsprachen
  • deskriptive Pattern
  • reguläre Ausdrücke
  • induktive Inferenz


35.50 €
in stock

34.50 €
45.50 €
49.50 €

(D) = Within Germany
(W) = Abroad

*You can purchase the eBook (PDF) alone or combined with the printed book (eBundle). In both cases we use the payment service of PayPal for charging you - nevertheless it is not necessary to have a PayPal-account. With purchasing the eBook or eBundle you accept our licence for eBooks.

For multi-user or campus licences (MyLibrary) please fill in the form or write an email to