General Doubt

Shaina Singh asked Jul 30, 2023

75 views

See all

Please log in or register to answer this question.

Related questions

0 votes

0 answers

Shaina Singh asked Aug 9, 2023

230 views

Theory Of Computation General Doubt
Let h : {0, 1}∗ → {a, b}∗ be the function defined by h(e) = e, h(0) = aa and h(1) = b, and for words of length two or greater: h(a1a2 . . . an) = h(a1)h(a2) . . . h(an) for n ≥ 2 and ai ∈ {0, 1}. For a language L ⊆ {0, 1}∗ we define h(L) ... over {a, b} that corresponds to h(L): (i) L = {0m1n | m, n ≥ 0}. (ii) L = {w ∈ {0, 1}∗ | w contains 010 as a subword}.

Let h : {0, 1}∗ → {a, b}∗ be the function defined by h(e) = e, h(0) = aa and h(1) = b,and for words of length two or greater:h(a1a2 . . . an) = h(a1)h(a2) . . . h(a...

Shaina Singh

230 views

Shaina Singh asked Aug 9, 2023

0 votes

1 answer

Prince Sindhiya asked Nov 28, 2018

196 views

general doubt toc
how to draw FA for this language $L=0^n1^m0^m:n+m\;mod\;6=0$

how to draw FA for this language$L=0^n1^m0^m:n+m\;mod\;6=0$

Prince Sindhiya

196 views

Prince Sindhiya asked Nov 28, 2018

1 votes

0 answers

Prince Sindhiya asked Nov 21, 2018

268 views

General doubt Toc
divisibility: |w| i.e length of string is divisible by a,b. If a doesn't divide b and b doesn't divide a then Min. states = a*b Case 1 : Divisible by a and b ----> If a divides b or b divides a then Min. No .of states = LCM(a,b) Case 2: ... b ------> If a divides b or b divides a then Min. states = GCD(a,b) Doubt -> is these all cases are true always ?

divisibility: |w| i.e length of string is divisible by a,b.If a doesn't divide b and b doesn't divide a then Min. states = a*bCase 1 : Divisible by a and b If a divide...

Prince Sindhiya

268 views

Prince Sindhiya asked Nov 21, 2018

2 votes

1 answer

rahul sharma 5 asked Jan 22, 2017

753 views

General Doubt In rice theorem
If we are not able to apply non-monote property ,then is it always true that it is RE but not REC,are there any scenarios where we can't apply non-monotone property but still language is NOT RE. Say,L={TM| L(TM) has atleast one string}, Now it is ... RE but not REC. P.S:- By (i) and (ii) ,i mean the definitions mentioned here.(http://gatecse.in/rices-theorem/)

If we are not able to apply non-monote property ,then is it always true that it is RE but not REC,are there any scenarios where we can't apply non-monotone property but s...

rahul sharma 5

753 views

rahul sharma 5 asked Jan 22, 2017

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

General Doubt

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0