The Gateway to Computer Science Excellence
0 votes
43 views
Find an npda with two states for the language $L =$ {$a^nb^{n+1} : n ≥ 0$}.
in Theory of Computation by Boss (15.4k points) | 43 views

1 Answer

+2 votes

Acceptance by empty stack.

 

by Active (1.7k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,293 answers
198,233 comments
104,916 users