Mumbai University > Informatica Technology > Sem 4 > Automata Theory

Marks: 8

Year:May 16

• A finite automaton has a set of states, starts in a start state, and reads an input string character-by-character, each character making it switch states depending on which character it read and which state it was previously in (state-character pair); this is called the transition function or transition relation. …