computer science - Push Down Automanton-Computation -


i trying understand how pda works. in following diagram understand how transition functions work , how stack must updated. question have why start state accept state well? while pda l = {on1n | n ≥ 0}, means must not accept empty string. can 1 explain reason making start accept state, please?

enter image description here

l = {0n1n | n ≥ 0}

when n=0, string is:

0010 = 0 0's followed 0 1's empty string. according definition, language l include empty string.

if not accept empty string, definition be:

l = {0n1n | n > 0}


Comments

Popular posts from this blog

apache - Remove .php and add trailing slash in url using htaccess not loading css -

javascript - jQuery show full size image on click -