I am too Lazy to update about me.

Not updated.

### Experience:

Not updated.
Babytud
10 months 2 weeks ago

Yes a pda can have two accepting/final states. If you look at the Formal definition of a PDA,

A PDA is formally defined as a 7-tuple:

where

is a finite set of states

•  is a finite set which is called the input alphabet
•  is a finite set which is called the stack alphabet
•  is a finite subset of , the transition relation.
•  is the start state
•  is the initial stack symbol
•  is the set of accepting states

F is the set of accepting states, that means it can be any number of accepting states but should be a subset of Q.

moreless
Babytud
Doubt
10 months 2 weeks ago

Please explain how many binary trees (structurally different) can be formed using n unlabelled nodes by using just the concept of combinations and not directly using the formula of Catalan Numbers.

Babytud
Doubt
1 year 9 months ago

#include<stdio.h>

#include<conio.h>

void main()

{

int i=25;

clrscr();

printf("%d",scanf("%d",&i));

getch();

}

Virtual GATE
Ranita Biswas
Pritam Prasun
Pritam Prasun
905
7 Sep 2017 - 7:53pm

Yes a pda can have two accepting/final states. If you look at the Formal definition of a PDA,

A PDA is formally defined as a 7-tuple:

where

is a finite set of states

•  is a finite set which is called the input alphabet
•  is a finite set which is called the stack alphabet
•  is a finite subset of , the transition relation.
•  is the start state
•  is the initial stack symbol
•  is the set of accepting states

F is the set of accepting states, that means it can be any number of accepting states but should be a subset of Q.

more less