sentence1: if δ is a function , then a is called a deterministic finite automaton .
sentence2: a finite automaton is a machine that has a finite set of states , can accept input from a finite set of input symbols , and changes its state when input is applied .