Title
The Ambiguity of Morphisms in Free Monoids and its Impact on Algorithmic Properties of Pattern Languages,Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
his book systematically discusses a basic problem in combinatorics on words: the ambiguity of morphisms, i. e. the question of whether, for any finite string s and any given morphism h, there is another morphism g satisfying g(s)=h(s). These studies yield a characterisation of those strings for which there exists an unambiguous morphism; furthermore, they lead to various insights into the ambiguity of important selected example morphisms. Additional considerations are concerned with the ambiguity of socalled terminalpreserving morphisms. Due to its fundamental nature, the ambiguity of morphisms shows strong connections to other topics in discrete mathematics and computer science such as pattern inference and equality sets; in particular, it is significantly related to various properties of Epattern languages. Therefore, the book provides a thorough survey on pattern languages and presents several profound advances in the understanding of this subject.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.