Register
Filter

Questions by satyam132

0 votes
1 answer
1
DLD#NUMBER SYSTEM
what us the radix ?? 38+43=80
what us the radix ??38+43=80
0 votes
2 answers
2
toc#cfg
what is the grammer of this language $^{a^nb^m} /n\neq m$??
what is the grammer of this language $^{a^nb^m} /n\neq m$??
1 votes
1 answer
3
compiler
E---->T+E T------>i a)LR(0) b)SLR c)LALR dnone
E >T+ET >ia)LR(0)b)SLRc)LALRdnone
1 votes
1 answer
4
toc#cfl
can someone give an example CFL is not closed under complement.???
can someone give an example CFL is not closed under complement.???
2 votes
1 answer
5
toc#csl
$L = a^nb^nc^n$. complement of $L$? regular cfl csl recursive
$L = a^nb^nc^n$. complement of $L$?regularcflcslrecursive
1 votes
1 answer
6
toc#reguler
how many states are there in a minimum DFA for language $L$ $L= 0, 00, 01, 001, 011$
how many states are there in a minimum DFA for language $L$$L= 0, 00, 01, 001, 011$
0 votes
1 answer
7
toc#reguler
Let $L1$ be a regular language and $L2=L1^*$. then $L2$ is?? a)always finite language b)always infinite language and regular c)need not be infinite language. d)none
Let $L1$ be a regular language and $L2=L1^*$. then $L2$ is??a)always finite languageb)always infinite language and regularc)need not be infinite language.d)none
2 votes
1 answer
8
toc#dfa
it is regular or not.? L= $a^{m^{n}}$ / n>0, m>n .
it is regular or not.?L= $a^{m^{n}}$ / n>0, m>n .
1 votes
1 answer
9
toc#language
let L =aba . prefix and suffix operation over the language L is used to perform the following X= ((prefix(L)$\cap$suffix(L)) / L .quotient operation(/) is also used in this then how many string are exist in X.
let L =aba . prefix and suffix operation over the language L is used to perform the followingX= ((prefix(L)$\cap$suffix(L)) / L .quotient operation(/) is also used in thi...
1 votes
2 answers
10
TOC#DFA
how many minimum number of state is required to construct a DFA of regular expression (a*+a*b*).
how many minimum number of state is required to construct a DFA of regular expression (a*+a*b*).
1 votes
1 answer
11
toc#reguler
L1=0*1*, L2=1*0*, L3=(0+1)*, L4=0*1*0*. then find the number of string in the following language L L=(L1$\cap$ L2) - (L3$\cap$L4)
L1=0*1*, L2=1*0*, L3=(0+1)*, L4=0*1*0*. then find the number of string in the following language LL=(L1$\cap$ L2) - (L3$\cap$L4)
1 votes
1 answer
12
made easy work book
1 votes
1 answer
13
made easy work book