Register

UGC NET CSE | June 2013 | Part 3 | Question: 37

• recategorized by
1,507 views
2 votes
2 votes

A pushdown automation $M=(Q, \Sigma, \Gamma,  \delta , q_0, z, F)$ is set to be deterministic subject to which of the following condition(s), for every $q \in Q, a \in \Sigma \cup \{\lambda\} \text{ and } b \in \Gamma$

 (s1) $\delta(q, a, b)$ contains at most one element

(s2) if $\delta(q, \lambda, b)$ is not empty then $\delta(q, c, b)$ must be empty for every $c \in \Sigma$

  1. only s1
  2. only s2
  3. both s1 and s2
  4. neither s1 nor s2
• recategorized by
User Avatar

1 Answer

0 votes
0 votes
C

Both
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
2
go_editor asked Jul 17, 2016
1,486 views
UGC NET CSE | June 2013 | Part 3 | Question: 39
Match the following : ... $\text{a-iii, b-i, c-iv, d-ii}$ $\text{a-ii, b-iv, c-i, d-iii}$
Match the following :$\begin{array} {} \text{a.}& \text{Context sensitive language} & \text{i.} & \text{Deterministic finite automation} \\ \text{b.}& \text{Regular gram...
User Avatar
3 votes
3 votes
1 answer
3
go_editor asked Jul 17, 2016
1,966 views
UGC NET CSE | June 2013 | Part 3 | Question: 38
For every context free grammar (G) there exists an algorithm that passes any $w \in L(G)$ in number of steps proportional to $ln\mid w \mid$ $\mid w \mid$ $\mid w \mid^2$ $\mid w \mid^3$
For every context free grammar (G) there exists an algorithm that passes any $w \in L(G)$ in number of steps proportional to$ln\mid w \mid$$\mid w \mid$$\mid w \mid^2$$\m...
User Avatar
4 votes
4 votes
2 answers
4
go_editor asked Jul 17, 2016
2,693 views
UGC NET CSE | June 2013 | Part 3 | Question: 36
The grammar with production rules $S \rightarrow aSb \mid SS \mid \lambda$ generates language $L$ given by: $L = \{ w \in \{a, b\}* \mid n_a(w) = n_b(w) \text{ and } n_a(v) \geq n_b(v) \text{ where v is any prefix of w} \}$ ...
The grammar with production rules $S \rightarrow aSb \mid SS \mid \lambda$ generates language $L$ given by:$L = \{ w \in \{a, b\}* \mid n_a(w) = n_b(w) \text{ and } n_a(v...
User Avatar
Link Copied!