If a string S is accepted by a finite state automaton, S=s1s2s3……sn where siϵ∑ and there exists a sequence of states r0,
Posted: Thu Jul 14, 2022 9:24 am
a) initial state
b) transition symbol
c) accepting state
d) intermediate state
b) transition symbol
c) accepting state
d) intermediate state