TOC......

[Nitesh Kumar]

Sir, is it possible to create a Finite automata ....for the Language
accepting equal no of a's and equal no of b's over the input alphabets
(a,b)*....
.

eg ... aabbaabbaabb, aaaabbbb,aaaaabbbbbba....etc...

I tried it a lot but not able to do...because a^n b^n id the
subset...fir the language....and finite automata is not possible for
this.....

SO is it possible to make a finite automata....for the Language
accepting equal no of a's and equal no of b's over the input alphabets
(a,b)*.............?????????

[Mareedu Manoj]

no we cant

we need memory element to check whether equal or not

we can do it by pda

[ASHISH SONI]

yes u can create finite automata for above all ditinct strings but we
can not make it as a generalised form becoz we not have memory to
compare ,and in above example finite automata is created but it will
be to big and not a feasible solution

[Mareedu Manoj]

(a,b)* is infinite language we cant create FA for some infinite languages
if it is finite we can create FA

[Er. Firoz. Ahamad.]

@Dear Nitesh!

There is no single chance of FA b/c for a large size of string we cant count to "a" and "b"  b/c FA has Finite size of mem so we ought to go for PDA or Turing  machine which uses  nonfinite mem size.

[shreshtha]

no we can't design.

becoz for this u need some extra memory to store no of a in the string..so that equal no of b can be accepted

and FSM didn't have extra memory...this can b surly done using PDA or Turing m/c..