The Gateway to Computer Science Excellence
+1 vote
299 views

Given a Turing Machine

$M = ({q_{0} , q_{1} }, {0, 1}, {0, 1, B}, \delta, B, {q_{1} })$ 

Where δ is a transition function defined as

$\delta(q_{0}, 0) = (q_{0}, 0, R)$

$\delta(q_{0}, B) = (q_{1}, B, R)$ 

The language $L(M)$ accepted by Turing machine is given as :

  1. $0^{*} 1^{*}$
  2. $00^{*}$
  3. $10^{*}$
  4. $1^{*}0^{*}$
in Theory of Computation by Boss (30.1k points)
recategorized by | 299 views
0
option B?

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,648 questions
56,459 answers
195,335 comments
100,188 users