Skip to main content
OverflowAI is here! AI power for your Stack Overflow for Teams knowledge community. Learn more

New answers tagged

1 vote
Accepted

Can I maintain Determinism of PDA just by changing stack symbol while keeping state and input symbol same?

Recall the definition of a non-deterministic PDA (NPDA) where the transition function has a mapping $\delta: Q \times (\Sigma \cup \{\lambda\}) \times \Gamma \rightarrow 2^{Q \times \Gamma^*}$ in ...
codeR's user avatar
  • 986
0 votes

Construct Pushdown Automaton that accepts language $x\in\{a,b\}^*, a=2b$

This is a solution for this problem I built in JFLAP
Vunag's user avatar
  • 1
-2 votes

Pushdown Automaton accept all words belong to language over (a,b) where the first letter 'a' has half of the occurences of the second letter 'b'

It represent the language {a^nb^2n} like abb,aabbbb,... let take an example abb you are pussing two a's for every 'a' you see, into stack and popping them by matching with b's
charan k's user avatar
0 votes

Pushdown Automaton accept all words belong to language over (a,b) where the first letter 'a' has half of the occurences of the second letter 'b'

Does anyone have any comments about the solution?
Vunag's user avatar
  • 1

Top 50 recent answers are included