Anaam Bidhan

Stationary Automata

Date: 12/7/2018
Time: 1:30PM-2:30PM
Place: 422 Armstrong Hall

Abstract: This talk concerns infinite automata on transfinite sequence (stationary automata). After an introduction starting from the well known idea of finite-state automata, I will introduce stationary automata (ST-automata). This concept is based on the definition of TF-automaton by Wojciechowski (1984). An ST-automaton defines a language which is a class of transfinite sequences, called words, over some set of symbols, called an alphabet. I will also define runs of ST-automata over words that are used to define the languages. A follow up talk will be given later.

All are welcome.