Question
Construct a NFA , N= {Q, S, d, q0, F}, S ={0,1}, that recognize the language: L = { w/w contains 2 consecutive identical digits}
Construct a NFA , N= {Q, S, d, q0, F}, S ={0,1}, that recognize the language:
L = { w/w contains 2 consecutive identical digits}
Hint: (a) start with q0 and define two paths depended on the input symbols, use transitions from the same input symbol to move to different states
- define 5 states , -q0,q1,q2,q3,q4,q5-
- create the transition table
b. find if the word 01001 is accepted from the NFA (formal proof)
Hint: start with dh (q0,01001),
c. find if the word 0100011 is accepted from the NFA (formal proof)
d. give the states of the NFA (stuck, threads) for any input digit of the 0100011
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started