You are not logged in |
Word problems
- Speaker(s)
- Piotr Hoffman
- Affiliation
- Uniwersytet Warszawski
- Date
- May 31, 2006, 2:15 p.m.
- Room
- room 5870
- Seminar
- Seminar Automata Theory
The talk will be an introduction to the world of word problems, in particular word problems for varieties of semigroups. Attention will be paid especially to commutative semigroups (reversible Petri nets). I intend to prove Redei's Theorem on finitely generated commutative semigroups and, if time allows, the decidability of the (uniform) word problem for commutative semigroups and the undecidability of the uniform word problem for finite semigroups.
