On the Ambiguity of Erasing Morphisms
Johannes C. Schneider
95 pages, year of publication: 2012
price: 33.00 EUR
Theoretical Computer Science, Discrete Mathematics, Combinatorics on Words, Ambiguity of Morphisms, Pattern Languages
This book discusses a very basic and fundamental phenomenon in combinatorics on words, namely the ambiguity of morphisms: A morphism h is called ambiguous for a word w provided that there is another morphism g which satisfies g(w)=h(w). If such another morphism does not exist, h is called unambiguous for w. Furthermore, there are different types of restricted ambiguity which make additional demands on the other morphism g. The examination of the ambiguity of morphisms is not only of intrinsic interest, but, due to the simplicity of the concept, also shows various connections to other topics in theoretical computer science and discrete mathematics, pattern languages and various other concepts as fixed points of morphisms, avoidable patterns and word equations. This book is the first comprehensive study of the ambiguity of erasing morphisms, i.,e., morphisms that are allowed to map symbols in the word to the empty word.
|print:||33.00 EUR ||
||eBundle*: ||43.00 EUR||
For multi-user or campus licences (MyLibrary) please fill in the form or write an email to email@example.com
*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.
Wollen auch Sie Ihre Dissertation veröffentlichen?