Register

theory od computation

• retagged by
2,523 views

1 Answer

Best answer
1 1 vote

alpabet can be anything either (a,b) or (0,1)

• selected by
Voting & Accepting an answer helps improve the community
← Previous · CIL17Next → · theory of computatio...
← Previous in category · theory of computatio...Next in category → · theory of computatio...
Position:
Show:

Related questions

1 1 vote
1 1 answer
102
102 views
GO Classes asked Sep 19
102 views
GO Classes DPP | GATE CS | Theory of Computation | De Morgan & NFA
Consider,Statement $1:$ If a language family is closed under union and complement, then it must also be closed under intersection. Statement $2:$ An NFA can be constructe...
2 2 votes
1 1 answer
148
148 views
GO Classes asked Sep 5
148 views
GO Classes DPP | GATE CS | Theory of Computation | Terminal-only Rules
Consider the right-linear grammar,$$\begin{aligned}A &\to fB \mid gA \\B &\to gA \mid fC \mid f \\C &\to gA \mid fC \mid f\end{aligned}$$When this grammar is converted in...
2 2 votes
1 1 answer
108
108 views
GO Classes asked Sep 5
108 views
GO Classes DPP | GATE CS | Theory of Computation | State Variable Method
Which of the following statements are correct for converting a finite automaton into an equivalent right-linear grammar?Each automaton state becomes a non-terminal. The s...
2 2 votes
1 1 answer
100
100 views
GO Classes asked Sep 5
100 views
GO Classes DPP | GATE CS | Theory of Computation | NFA to Grammar
Consider the NFA given below: Which right-linear grammar is obtained by the standard NFA-to-grammar construction?$q_0 \to aq_1$,$q_1 \to aq_0 \mid bq_1 \mid \epsilon$ $q_...