Crowdly
Додати до Chrome
Consider the pushdown automaton (PDA) embodied by the diagram below, which accep...
✅ Перевірена відповідь на це питання доступна нижче. Наші рішення, перевірені спільнотою, допомагають краще зрозуміти матеріал.
Consider the pushdown automaton (PDA) embodied by the diagram below, which accepts by final state. Let us denote this PDA by P1. The PDA P1 has states {1,2}, alphabet symbols {a,b}, stack symbols {#,a,b}, transitions as depicted in the diagram, start state 1, initial stack symbol # and final state 2. Select all of the words below (from 1 to 6) which are accepted by P1.
Words:
1. aaabb2. abaa3. baab4. a5. ababab6. bbaba
❌
❌
❌
❌
✅
❌