Register

PDautomata

• edited by
365 views
0 0 votes

What is language accepted by above PDA, where 0 is final state and 1 denotes non-final state ?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Virtual Gate Test Se...Next → · algo + bfs
← Previous in category · ace mock - tocNext in category → · L={<M> : M is a TM t...
Position:
Show:

No related questions found