Combinatorics Seminar 2017

Speaker: Mikhail V. Volkov (Волков Михаил Владимирович), Ural Federal University

Date: Wed, May 10, 2017

Time: 10:00 - 11:30

Venue: Middle Meeting Room

Title: Completely reachable automata


We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.

This is joint work with Evgenija A. Bondar.

Slides: View slides