#stringsintheoryofcomputation

[smartcherryposts]

NFA To DFA Conversion In Theory Of Computation

NFA To DFA Conversion In Theory Of Computation Construct The DFA For The Following NFA

    DFA Using DFA Transition Table If All States Are Final The Minimal DFA Will Be

My Initial State Will Be My Final State And This Is The DFA.   Example-2

Conversion Of NFA To DFA

Find The Minimal No Of States In NFA

Solution:- Transition Table For Given Diagram

This Is One Of The Different Questions. To Solve This Question We Are Going To Use Short Cut. If You Are Expert In Constructing DFA, You Can Solve This Question Using Short Cut.   The Question Given Is "Find The Minimal No.Of States In NFA" Means We Have To Find The Minimum No Of States In Given NFA.   There Will Be No Uniqueness In NFA. If It Is Not Unique, How Can We Find Minimal States?  

Remember

If The Question Is Asked To Find Minimal No Of States, The Diagram Should Be Unique And Should Be Minimal(Optimized) We Know DFA Means Minimized, We Can Construct Unique DFA, We Can Construct A Unique DFA For A Language. It Means The No Of States In DFA wILL Be Unique.   "Every DFA Is Not NFA" We Know But Every NFA Is Not DFA   Simple We Have To Draw DFA For Given NFA We Already Drawn Many DFA From NFA's In Previous Topics.   We All Know That Procedure.   But Here To Solve This Problem Using Short Cut. If We Can Predict The Language For Given NFA, Then We Can Find DFA Easily   I Have Solved Many Problems Before In Previous Posts We Have Seen How To Construct DFA Directly In Previous Solved Problems.   I Want You To Identify The Language For The Given Nfa & For That NFA For That Language, You Have To Draw DFA. Very SImple.

If You Observe Above NFA 0,1 Is Going To q0 Then After 3 Zero's 000, It Is Going To Final State. Means String Should ContainThree Zero's(000) Continuously For Sure And Final State q3 Has Loop Of '0', It Means The String Should End With Three Zero's(000) String Compulsorily Should Contain 3 Zero's This Is The Language For This Given NFA.   DFA

  Explanation For DFA

If I Get '1' , I'll Be On q0 Only If I Get '0 On 'q0' I'll Go To 'q1' If I Get '0' On 'q1' I'll Go To 'q2' If I Get '0' On 'q2' I'll Go To 'q3'(FINAL STATE) Because I Should Reach Final State Once I Get 3 Zero's String If I '1' On 'q1','q2','q3' I'll Go To Initial State 'q0' And I'll Start Machine Again I Cant Go To Dead State If I Get '1' On q1,q2,q3 If I Go To Dead State I Can't Get Back And I Cant Start The Machine Again   Read the full article

[smartcherryposts]

Theory Of Computation - Practice Questions On Language

If You Have the Ability To Think About A Problem These Problems Are Damn Eay For You, Lets Understand And Solve The Questions About Language In Theory Of Computation. Before Solving Questions I Hope You Understood About Language Which I Explained In Previous Post, If You Have Not Read, Click Here If You Know About Language Already, let's Solve The Questions On Language

  Q) Choose The Correct Statement From The Following. a) Every Regular Language Is Finite b) Every Non-Regular Language Is Finite c) Every Regular Language Is Infinite d) Every Non-Regular Language Is Infinite   Answer - d) Every Non-Regular Language Is Infinite Explanation - If You See The Language Hierarchy, Every Non-Regular Language Is Infinite

  Q) Which Of The Most Appropriate Answer For Finite Language. a) L Is Regular b) L Is CFL c) L Is CSL d) L Is REL   Answer -  L Is Regular   Explanation - Yes, L Is Regular Is The Most Appropriate Answer Because CFL, CSL, REL May Or May Not Be Appropriate.

Read the full article

[smartcherryposts]

Theory Of Computation Practice Questions

Theory Of Computation Practice Questions Solved And Explained Briefly.  

Which Of The Following Statement Is Correct?

a) DFA Is More Efficient Than NFA b) NFA Is More Efficient Tham Than DFA c) DFA Is More Powerful Than NFA d) NFA Is More Powerful Than DFA   Answer Is a) Explanation 

E(NFA)=E(DFA) Expressive Power Of NFA Is Equal To DFA, The Languages Accepted By NFA Are Equal To The Languages Accepted By DFA. I Can Draw NFA For All RL. I Can Draw DFA For All RL.   Hence DFA Is More Efficient Because I'll Have Only One Router Or Way.  

2) Choose The Incorrect Statement From The Following.

a) DPDA Is More Efficient Than NPDA b) Capabilities Of DPDA & NPDA Are Same c) NPDA Is More Powerful Than DPDA. d) NOTA   Answer - b Explanation

E(NPDA)≥E(DPDA)  

3) For Which Of The Language An Automata Can Be Constructed In Both Deterministic And Non-Deterministic Mode To Accept That Language.

a) Regular b) CFL c) REL d) NOTA   Answer - a) & c)   Explanation a)E(NFA)=E(DFA)

b) E(NPDA) ≥ E(DPDA)

c) E(NTM)=E(DTM)

d) ×  

4) Choose Correct Statement From The Following

a) DFA Is More Powerful Than DPDA b) DPDA Is More Powerful Than DFA c) NFA Is More Powerful Than NPDA D) NOTA   Answer - b)   Explanation

a) FA Read the full article