Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics
Qiang Wang, Benjamin Steinberg, Zhenheng Li, Mahir Can
1 367 kr
1 964 kr
Läs direkt i Bokus Reader – eller ladda ned till din enhet
This reference discusses how automata and language theory can be used to understand solutions to solving equations in groups and word problems in groups. Examples presented include, how Fine scale complexity theory has entered group theory via these connections and how cellular automata, has been generalized into a group theoretic setting. Chapters written by experts in group theory and computer science explain these connections.