Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatori
213,42 €
Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns.
Jetzt bei Ebay: