Languages and Automata
-
Edited by:
Benjamin Steinberg
About this book
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.
Covers recent breakthroughs on describing solutions sets to systems of equations in free groups via ETD0L languages.
Survey of Stallings automata and their algorithmic properties.
Chapters on cellular automata over groups and automaton groups.
Author / Editor information
Benjamin Steinberg, City College of New York, USA.
Topics
-
Download PDFPublicly Available
Frontmatter
I -
Download PDFPublicly Available
Contents
V -
Download PDFPublicly Available
List of Contributing Authors
VII -
Requires Authentication UnlicensedLicensed
1 Cellular automata over shifts and subshifts: Garden of Eden theorems and surjunctivity
1 -
Requires Authentication UnlicensedLicensed
2 Languages, groups, and equations
63 -
Requires Authentication UnlicensedLicensed
3 Stallings’ automata
95 -
Requires Authentication UnlicensedLicensed
4 Groups with multiple context-free word problems
161 -
Requires Authentication UnlicensedLicensed
5 Parallel complexity in group theory
183 -
Requires Authentication UnlicensedLicensed
6 The word problem for automaton groups
265 -
Requires Authentication UnlicensedLicensed
Index
397
-
Manufacturer information:
Walter de Gruyter GmbH
Genthiner Straße 13
10785 Berlin
productsafety@degruyterbrill.com