Register

theory of computation

271 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Virtual gateNext → · #dbms query
← Previous in category · toc decidabilityNext in category → · Infinite union of re...
Position:
Show:

Related questions

0 0 votes
1 1 answer
30
30 views
GO Classes asked 17 hours ago
30 views
GO Classes DPP | GATE CS | Theory of Computation | Automata
Consider the language $L=\{ww^R\mid w\in\{a,b\}^*\}$ where $w^R$ denotes the reverse of string $w$.Evaluate the following statements. Which statement is correct?The langu...
0 0 votes
1 1 answer
30
30 views
GO Classes asked 17 hours ago
30 views
GO Classes DPP | GATE CS | Theory of Computation | Turing Machine
Consider a Turing machine defined by the following transition rules, starting in state $q_0$:$$\begin{aligned} \delta(q_0,0)&=(q_0,0,R)\\ \delta(q_0,1)&=(q_1,0,R)\\ \delt...
0 0 votes
1 1 answer
30
30 views
GO Classes asked 1 day ago
30 views
GO Classes DPP | GATE CS | Theory of Computation | TM Language Acceptance
Consider a Turing machine whose initial state is $q_0$, with the following transition table.Here, $<$ and $>$ are left and right tape markers, respectively. The symbols $...
1 1 vote
1 1 answer
39
39 views
GO Classes asked 1 day ago
39 views
GO Classes DPP | GATE CS | Theory of Computation | Turing Machine Design
Consider the language, $L=\{a^nb^nc^n\mid n\geq1\}$This language is not context-free and requires a mechanism that can verify equality among three consecutive blocks.Whic...