Optimal codes for Finite State Machines

Title of the Talk: Optimal codes for Finite State Machines
Speakers: Prof Sankardeep Chakraborty
Host Faculty: Prof M V Panduranga Rao
Date: Sep 12, 2025
Time: 3:30 pm
Venue: EEL01 Seminar Hall, EE/CS building

Abstract:
Finite state machines are one of the simplest models of computation studied in automata theory. In this talk, we will discuss how one can design optimal codes for Finite state machines such that string membership can be verified optimally.

Bio:
Prof Sankardeep Chakraborty interests lies in Graph theory, Data structures and Algorithms. He completed his PhD with Prof Venkatesh Raman from MatScience (IMsc). Then he did postdocs at University of Tokyo (UOT) and National Institute of Informatics before joining UOT as Assistant Professor.