Minimum finite automata

Question

Construct the Minimum FA that accepts all the string of 0's and 1's where

A)Every String start and end with Zero.

B)Every string Start and end with Same Symbol.

Comments

You can do it by construction the regular expression for the FA.

For the first, it will be: 0(0+1)*0 + 0

For the second, it will be: 0(0+1)*0 + 1(1+0)*1 + 0 + 1

---

Can you please give the State Diagram

---

What have you tried? If you show where you are stuck, maybe other people can help you.

Answer 1

• Starting and ending with symble 0

Starting and endin with same symble

 

 

Comments

ok, let's think about some regular expression rules.

1)  0ε=0=ε0

suppose if we replace ε by a or b or c

0a=a or a=a0 ?

---

can you perform 1st part using concatenation.

please show me.

---

@suraj patel, my intension is not querying with you...

if you are saying ∈ also in Language then, starting and ending with 1 also should be in language

due to 1 = ∈ . 1 . ∈

11 = ∈ . 11 . ∈

if you are not getting comment one more time....