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'

Question

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'. Can someone help me with a JFLAP like digram of this Automaton?

Vunag · Answer 1 · 2024-05-11T15:21:33.090

0

Does anyone have any comments about the solution?

edited May 11 '24 at 15:21

answered May 11 '24 at 15:01

Vunag

1
1

score -2 · Answer 2 · answered May 11 '24 at 15:36

-2

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

answered May 11 '24 at 15:36

charan k

1

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'

2 Answers2

Linked