Home > Theory Of Computation geek for geeks

### Conversion Of E-NFA To NFA – Theory Of Computation

Conversion Of E-NFA To NFA - Theory Of Computation Example-1 ε-Closure (q0) - {q0,q1} ε-Closure (q1) - {q1} ε-Closure (q2) - {q2} ε-Closure (q3) - {q3,q1q2} 1)  Initial State - q0 2) Construction Of δ1 Note:- When We Convert ε-NFA To NFA, There Will Be No Change In Number Of States. This Is The Resultant Diagram. There Is No-Transition With 'ε"(Epsilon)

### 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

### Applications Of Language And String

The Comparision Part, Checking And Comparing The Given String With Pre Defined String Or The Checking Part Is Called As Applications Or Language And String.   Language Means Collection Of Strings. String Means Collections Of Alphabets.   But In Language There Are Conditions, A String Must Satisfy The Condition Of The Language, To Be In

### 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

### Part 1: 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

### Types Of Languages – Types Of Grammars – Types Of Automata(Machine)

Types Of Languages - Every Language Have Two Components, One Is Grammer And Another One Is Acceptor Or Machine. Grammer Generates Language, Acceptor Accepts The Language, Acceptor Is A Machine. If The Language Changes Then Its Grammer Is Also Changes, If The Language Changes The Machine Also Changes, Which Accepts The

### Day 3: Power Of Alphabets In Automata

Power Of Alphabets (∑) In Automata, If ∈ Is An Alphabet Then ∑k Is The Set Of All The String From The Alphabet ∈ Of Length Exactly k. Example - ∑= {a,b}  // a & b are input alphabets We Are Talking About ∑k  (Sigma To The Power Of k)   ∑ 1= Set Of All The String Of Length