University of Birmingham > Talks@bham > Algebra Seminar  > Generating lamplighter groups with bireversible automata

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Generating lamplighter groups with bireversible automata

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Lewis Topley.

We use the language of formal power series to construct finite state automata generating groups of the form A \wr Z, where A is the additive group of a finite commutative ring and Z is the integers. We then provide conditions on the units of the ring and the power series which make automata bireversible.

This is a joint work with Benjamin Steinberg.

This talk is part of the Algebra Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Type the title of a new list here Lab Lunch Data Science and Computational Statistics Seminar

Other talks

TBC Ultrafast, all-optical, and highly efficient imaging of molecular chirality Modelling uncertainty in image analysis. Sensing and metrology activities at NPL, India The development of an optically pumped magnetometer based MEG system When less is more - reduced physics simulations of the solar wind
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.