Home > dfa in toc

### Conversion Of NFA To DFA

Conversion Of NFA To DFA Construct The DFA For The Following NFA Solution:- DFA TRANSITION TABLE AFTER MERGING SAME STATES TO ONE STATE, I'LL DELETE ONE OF THESE STATES If You Observe Given NFA The String Is Containing ab As Substring. In This D FA Also The String Contains ab As Substring.   Every State In This Given

Read More

### DFA Example : Consider he Following DFA And Count The Number Of All The String Accepted By DFA Which Have Length 5

Consider The Following DFA And Count The Number Of All The String Accepted By DFA Which Have Length 5   a) 29 b) 64 c) 26 d) 21 First Path Is You Have To See How Many Paths We Have To Reach Final State From Starting State. 15+7+4=26 Strings Are Possible.

Read More

### DFA Example : Consider Following DFA M, Let S Be The Set Of All 7 Bit String In Which First,Fourth And Last Bit Is One Then No. Of String In S Which Is Accepted By Machine M Is

Consider Following DFA M, Let S Be The Set Of All 7 Bit String In Which First, Fourth And Last Bit Is One Then No. Of String In S Which Is Accepted By Machine M Is a) 15   b) 16   c) 7   d) 8   Solution:-  Given First, Fourth, Last Bit Is '0' Then No.

Read More

### DFA Example : Consider The Following DFA And Find Out How Many Strings It Accepted Of Length ‘7’ Which Start From 10

Consider The Following DFA And Find Out How Many Strings It Accepted Of Length '7' Which Start From 10 a) 16 b) 32 c) 48 d) NONE Solution:- Question Is Seven Length _ _ _ _ _ _ _ Starts With 10 First Two Bits I Cant Change, 10 Will Be There. Lets See In Diagram

Read More

### DFA Example : Consider The Following DFA And Find Out How Many Strings It Accepts

Consider The Following DFA And Find Out How Many Strings It Accepts Solution:-  TOTAL Given - 7 States From Starting State q0 I'll Go To q1 If I Get 0 Or 1 From q1 I'll Go To q2 If I Get 0 Or 1 From q2 I'll Go To q3 If I Get 0 Or 1 From q3 I'll Go To q4 If

Read More

### Construct The Minimal DFA Which Accept All Integers Which Are Divisible By ‘6’

Construct The Minimal DFA Which Accept All Integers Which Are Divisible By '6'   L={0,6,12,18,24......} For Binary Numbers, The Input Symbols Were 0,1 i,e Σ={0,1}   But Here In This Problem. We Are Seeing Integer Number System. Means Decimal Number System (0,1,2,3,4,5,6,7,8,9)   In Decimal Number System The Base Will Be 10, We All Know That.   Means 0-10, Any Number Can Come From

Read More

### DFA Example : Direct Calculation Of Number Of States

Direct Calculation Of Number Of States - Let's See The Technique With Which We Can Get No. Of States Very Easily This Is The ' Short Cut ' And Short Cut's Are Very Important To Solve Problem Quickly.   This Helps In Getting Minimal DFA Using This Technique We Can Directly Know The Number Of

Read More

### Construct Minimal DFA That Accepts All The Strings Of 0’s & 1’s Who’s Integer Equivalent Is ≅ 3 Mod 8

Construct Minimal DFA That Accepts All The Strings Of 0’s & 1’s Who’s Integer Equivalent Is ≅ 3 Mod 8 Question Given Is The Binary String I Have Which I Will Convert It Into Integer And If I Divide It With '8' So I Should Get Remainder '3' This Is The Question Given.   1.Example:- Let

Read More

### Construct Minimal DFA That Accepts All The Strings Of 0’s & 1’s Who’s Integer Equivalent Is ≅ 0 Mod 4

Construct Minimal DFA That Accepts All The Strings Of 0's & 1's Who's Integer Equivalent Is ≅ 0 Mod 4 Given Σ={0,1} (1000)2=(8)10 // 1000 is binary number, 2 is base of 1000, 8 is decimal integer & 10 is base of 8. If This Is Divisible By '4', Then It Goes To Final State,

Read More

### Construct Minimal DFA That Accepts All The Strings Of 0’s & 1’s Who’s Integer Equivalent Is ≅ 0 Mod 5

Construct Minimal DFA That Accepts All The Strings Of 0's & 1's Who's Integer Equivalent Is ≅ 0 Mod 5 Given Σ={0,1} In This Problem, We Are Going To Convert Binary Into Integer. (1010)2 =(0×20+1×21+0×22+1×23) =0+2+0+8=(10)10 The Possible Remainders

Read More