Pricing complexity options

Bjørn Kjos-Hanssen

Department of Mathematics, University of Hawaii at Manoa

MATH 649B, Watanabe 113, 9:30am, November 30, 2015, U. Hawaii at Manoa

Joint work with Malihe Alikhani, Amirarsalan Pakravan, and Babak Saadat

Example

Pictured: a finite state automaton which only accepts one string of length 22, namely 0100011001010101111100, and which has 10 states. We say that this automaton is a witness to the fact that the string 0100011001010101111100 has automatic complexity at most 10.