Designing Non-Deterministic Finite Automata (Set 1) - GeeksforGeeks

03 Jul, 2020
Prerequisite: Finite Automata IntroductionIn this article, we will see some designing of Non-Deterministic Finite Automata (NFA).
Problem-1: Construction of a minimal NFA accepting a set of strings over {a, b} in which each string of the language starts with ‘a’.Explanation: The desired language will be like:
L1 = {ab, abba, abaa, ...........}
Here as we can see that each string of the above language starts with ‘a’ and end with any alphabet either ‘a’ or ‘b’.But the below language is not accepted by this NFA because none of the string of below language starts with ‘a’.
L2 = {ba, ba, babaaa..............}
The state transition diagram of the desired language will be like below:In the above NFA, the initial state ‘X’ on getting ‘a’ as the input it transits to a final state ‘Y’. The final state ‘Y’ on getting either ‘a’ or ‘b’ as the input it remains in the state of itself.
def stateX(n):    #if length of n become 0     #then print not accepted    if(len(n)==0):        print("string not accepted")              else:         #if at zero index         #'a' found call        #stateY function            if (n[0]=='a'):            stateY(n[1:])                  #if at zero index         #'b' then print         #not accepted        elif (n[0]=='b'):            print("string not accepted")            def stateY(n):    #if length of n become 0     #then print accepted    if(len(n)==0):        print("string accepted")              else:          #if at zero index         #'a' found call        #stateY function            if (n[0]=='a'):            stateY(n[1:])                      #if at zero index         #'b' found call        #stateY function            elif (n[0]=='b'):            stateY(n[1:])                                            #take inputn=input()  #call stateA function#to check the inputstateX(n)
Problem-2: Construction of a minimal NFA accepting a set of strings over {a, b} in which each string of the language is not starting with ‘a’.Explanation: The desired language will be like:
L1 = {ba, bba, bbaa, ...........}
Here as we can see that each string of the above language is not starting with ‘a’ but can end with either ‘a’ or ‘b’.But the below language is not accepted by this NFA because some of the string of below language starts with ‘a’.
L2 = {ab, aba, ababaab..............}
The state transition diagram of the desired language will be like below:In the above NFA, the initial state ‘X’ on getting ‘b’ as the input it transits to a final state ‘Y’. The final state ‘Y’ on getting either ‘a’ or ‘b’ as the input it remains in the state of itself.
def stateX(n):    #if length of n become 0     #then print not accepted    if(len(n)==0):        print("string not accepted")              else:         #if at zero index         #'b' found call        #stateY function            if (n[0]=='b'):            stateY(n[1:])                  #if at zero index         #'a' then print         #not accepted        elif (n[0]=='a'):            print("string not accepted")            def stateY(n):    #if length of n become 0     #then print accepted    if(len(n)==0):        print("string accepted")              else:          #if at zero index         #'a' found call        #stateY function            if (n[0]=='a'):            stateY(n[1:])                      #if at zero index         #'b' found call        #stateY function            elif (n[0]=='b'):            stateY(n[1:])                                            #take inputn=input()  #call stateA function#to check the inputstateX(n)
_mridul_bhardwaj_
GATE CS
Theory of Computation & Automata
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Page Replacement Algorithms in Operating Systems
Normal Forms in DBMS
Differences between TCP and UDP
Semaphores in Process Synchronization
LRU Cache Implementation
Difference between DFA and NFA
Difference between Mealy machine and Moore machine
Turing Machine in TOC
Conversion from NFA to DFA
Converting Context Free Grammar to Chomsky Normal Form