If A String S Is Accepted By A Finite State Automaton #110
If a string S is accepted by a finite state automaton, S=s<sub>1</sub>s<sub>2</sub>s<sub>3</sub>……s<sub>n</sub> where s<sub>i</sub>ϵ∑ and there exists a sequence of states r0, r1, r2…… rn such that δ(r(i), s<sub>i+1</sub>) =r<sub>i+1</sub> for each 0, 1, …n-1, then r(n) is:
This multiple choice question (MCQ) is related to the book/course
gs gs101 Automata Theory.
It can also be found in
gs gs101 Finite Automata - Extended Transition Function - Quiz No.1.
If a string S is accepted by a finite state automaton, S=s1s2s3……sn where siϵ∑ and there exists a sequence of states r0, r1, r2…… rn such that δ(r(i), si+1) =ri+1 for each 0, 1, …n-1, then r(n) is:
initial state
transition symbol
accepting state
intermediate state
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
