676 views
0 votes
0 votes

The pushdown automata $M=\left \{ \left ( q_{0},q_{1},q_{2} \right ),\left ( a,b \right ) ,\left ( 0,1 \right ),\partial ,q_{0},0,\left \{ q_{0} \right \}\right \}$

$\partial \left ( q_{0},a,0 \right )=\left ( q_{1},10 \right )$

$\partial \left ( q_{1},a,1 \right )=\left ( q_{1},11 \right )$

$\partial \left ( q_{1},b,1 \right )=\left ( q_{2},\lambda \right )$

$\partial \left ( q_{2},b,1 \right )=\left ( q_{2},\lambda \right )$

$\partial \left ( q_{2},\lambda ,0 \right )=\left ( q_{0},\lambda \right )$

Accepts language 

$l=\left \{ a^{n}b^{n}\mid n\geq 0\right \}$

$l=\left \{ a^{n}b^{n}\mid n> 0\right \}$


Please tell me with these two options which one is correct? I think here $q_{2}$ is accepting state , not $q_{0}$ 

As last transition going from $q_{2}$ to $q_{0}$ and not $q_{0}$ to $q_{2}$

Am I right?

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
Souvik33 asked Dec 4, 2022
332 views
Consider the following statementS: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFLThe above statement is:TRU...
0 votes
0 votes
1 answer
2
srestha asked May 2, 2019
574 views
The number of distinct 1 letter subword present in “NAMITA” is equal to_______________Answer given subwords are N,A,M,I,TBut last ‘A’ is not a subword. Is it cor...
1 votes
1 votes
1 answer
3
srestha asked Apr 23, 2019
935 views
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________Answer will be...
0 votes
0 votes
1 answer
4
amitarp818 asked Nov 18, 2023
223 views
Given L1 = {a*baa*} and L2 = {ab*}The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by