Register

Recent questions tagged context-sensitive

0 votes
2 answers
4
Theory of Computation | Automata
L= {$a^nb^nc^nd^n; n\geq 0$} Given Language is a CSL TRUE FALSE
L= {$a^nb^nc^nd^n; n\geq 0$} Given Language is a CSLTRUEFALSE
User Avatar
2 votes
1 answer
5
ace academy ToC
I don’t get the explanation, How do you categorize grammer on the basis of production?
I don’t get the explanation, How do you categorize grammer on the basis of production?
User Avatar
0 votes
1 answer
6
Context Sensitive Grammars
Is the following CSG for a^n b^n c^n correct? S->aSbC|abc Cb->bC C->c If not please explain why?
Is the following CSG for a^n b^n c^n correct?S->aSbC|abcCb->bCC->cIf not please explain why?
User Avatar
0 votes
1 answer
7
Closure Properties of Languages
let L = “CFL but not REGULAR”, Can we get complement of L as CFL? Unlike in the case of Recursively Enumerable(RE) language where if L = “RE but not RECURSIVE”, its complement can never be RE.
let L = “CFL but not REGULAR”, Can we get complement of L as CFL?Unlike in the case of Recursively Enumerable(RE) language where if L = “RE but not RECURSIVE”, it...
User Avatar
0 votes
2 answers
8
UGC NET CSE | June 2005 | Part 2 | Question: 32
Which of the following is the most general phase – structured grammar ? Regular Context – Sensitive Context free None of these
Which of the following is the most general phase – structured grammar ?RegularContext – SensitiveContext freeNone of these
User Avatar
0 votes
0 answers
11
Ace Book
The complement of the language L containing an equal number of a's , b's and c's is a)regular b)context free c)context sensitive but not context free d)recursive and not a CFL
The complement of the language L containing an equal number of a's , b's and c's isa)regularb)context freec)context sensitive but not context freed)recursive and not a CF...
User Avatar
0 votes
0 answers
12
Doubt in Grammar
What is the difference between phase structured grammar and phrase structured grammar?
What is the difference between phase structured grammar and phrase structured grammar?
User Avatar
0 votes
2 answers
14
UGC NET CSE | July 2018 | Part 2 | Question: 37
Context sensitive language can be recognized by a Finite state machine Deterministic finite automata Non-deterministic finite automata Linear bounded automata
Context sensitive language can be recognized by a Finite state machineDeterministic finite automataNon-deterministic finite automataLinear bounded automata
User Avatar
0 votes
2 answers
15
context sensitive grammer
it is given that in csg if @-># then length of @ should be less or equal to # then how aaB->c is a csg???
it is given that in csg if @->#then length of @ should be less or equal to #then how aaB->c is a csg???
User Avatar
1 votes
2 answers
16
Regular and CFL
LC may be CFL LC cannot be CFL LC may be regular LC may or may not be CFL
LC may be CFL LC cannot be CFL LC may be regular LC may or may not be CFL
User Avatar
2 votes
1 answer
17
Doubt in CSL and CFL
$a) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ or\ j\ \neq k\ \}$ $b) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ and\ j\ \neq k\ \}$ a) CFL(union of two OR-ed comparisons ) b) CSL( Double comaprison ) Am I correct?
$a) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ or\ j\ \neq k\ \}$$b) \{\ 0^i\ 1^j\ 2^k\ \ | where\ i\ \neq j\ and\ j\ \neq k\ \}$a) CFL(union of two OR-ed compa...
User Avatar
5 votes
1 answer
19
Regular and CFL
Let L={ai bj ck ┤|if j is odd then i=k} where i,j,k>0. Which of the following option is true about L? L is CSL but not CFL L is CFL but not DCFL L is regular L is DCFL but not regular
Let L={ai bj ck ┤|if j is odd then i=k} where i,j,k>0. Which of the following option is true about L? L is CSL but not CFL L is CFL but not DCFL L is regular L is D...
User Avatar
0 votes
0 answers
20
Peter Linz Edition 4 Example 10.5 (Page No. 272)
Find a linear bounded automata that accepts the language 1. L={a^(n!) : n>=0} 2. L ={a^n : n is perfect square} Please explain.
Find a linear bounded automata that accepts the language1. L={a^(n!) : n>=0}2. L ={a^n : n is perfect square}Please explain.
User Avatar
2 votes
3 answers
22
CSL and Regular language
if L1 = { anbncn | n>= 0 } and L2 = { anbmck | k,n,m>=0} L1 is CSL and L2 is regular. Now L3 = L1.(L2)*. Is L3 is regualar or CSL?
if L1 = { anbncn | n>= 0 } and L2 = { anbmck | k,n,m>=0}L1 is CSL and L2 is regular.Now L3 = L1.(L2)*.Is L3 is regualar or CSL?
User Avatar
Page: