Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for number-theory
0
votes
1
answer
1
Find the number of final states in DFA that recognizes L, where L= {w1a w2:|w1|≥3,|w2|≤5}, ∑={a, b} and w1, w2 ∈ ∑ * ______
Hritik1204
313
views
Hritik1204
asked
Jan 5
Theory of Computation
theory-of-computation
finite-automata
number-of-dfa
minimal-state-automata
+
–
4
votes
1
answer
2
GATE IN 2023 | GA Question: 3
A 'frabjous' number is defined as a $3$ digit number with all digits odd, and no two adjacent digits being the same. For example, $137$ is a frabjous number, while $133$ is not. How many such frabjous numbers exist? $125$ $720$ $60$ $80$
A 'frabjous' number is defined as a $3$ digit number with all digits odd, and no two adjacent digits being the same. For example, $137$ is a frabjous number, while $133$ ...
admin
3.2k
views
admin
asked
May 22, 2023
Quantitative Aptitude
gatein-2023
quantitative-aptitude
number-theory
+
–
0
votes
1
answer
3
parsers and dfa construction
Hi, there my question is while constructing DFA for LL(1) or LR(0), or SLR (1). parsing I'm seeing different variants of DFA for the same problem set, and I'm not able to determine which is correct and which is not please help I'm providing a question ... S->dA/aB A->bA/c B->bB/c so first is this second is this which one is correct and why please ex
Hi, there my question is while constructing DFA for LL(1) or LR(0), or SLR (1). parsing I'm seeing different variants of DFA for the same problem set, and I'm not able to...
utkarsh2077
219
views
utkarsh2077
asked
Dec 4, 2023
Compiler Design
theory-of-computation
number-of-dfa
number-of-states
+
–
0
votes
0
answers
4
Michael Sipster Theory of Computation
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.
baofbuiafbi
158
views
baofbuiafbi
asked
Nov 14, 2023
Theory of Computation
theory-of-computation
number-of-dfa
michael-sipser
+
–
1
votes
1
answer
5
Minimal Finite Automata - Theory of Computation
Consider the set of all binary strings where the difference between the number of 0’s and number of 1’s is even. The minimum number of states in a DFA that accepts the given set is _____________? (kindly explain the approach to this problem)
Consider the set of all binary strings where the difference between the number of 0’s and number of 1’s is even. The minimum number of states in a DFA that accepts th...
stillhere
400
views
stillhere
asked
Sep 10, 2023
Theory of Computation
minimal-state-automata
finite-automata
theory-of-computation
number-of-states
+
–
0
votes
1
answer
6
Made easy test series
Please explain the why A and D are correct?
Please explain the why A and D are correct?
Rohit Chakraborty
462
views
Rohit Chakraborty
asked
Oct 5, 2023
Theory of Computation
theory-of-computation
regular-expression
number-of-dfa
made-easy-test-series
+
–
0
votes
1
answer
7
#numbertheory
Prove that : In triangular series 1 = 1 1+2 = 3 1+2+3 = 6 1+2+3+4 = 10 ………….. Triangular number in 8n+1 always form perfect square .
Prove that :In triangular series1 = 11+2 = 31+2+3 = 61+2+3+4 = 10…………..Triangular number in 8n+1 always form perfect square .
NarutoUzumaki
167
views
NarutoUzumaki
asked
Oct 6, 2023
Mathematical Logic
number-theory
discrete-mathematics
+
–
1
votes
1
answer
8
Applied Roots TOC practice set 2 2019
iam.sahilpatra
141
views
iam.sahilpatra
asked
Sep 9, 2023
Theory of Computation
theory-of-computation
number-of-dfa
+
–
0
votes
1
answer
9
GATE CSE 2020
Is this language a regular language ? If yes why and if No why ? The last part is “x!=y” cropped in the picture According to my understanding this is not regular because its says number of x = number of y But Finite automata cant compare the number of x and y here with limited memory. Can you please explain ?
Is this language a regular language ? If yes why and if No why ?The last part is “x!=y” cropped in the pictureAccording to my understanding this is not regular becaus...
dutta18
1.3k
views
dutta18
asked
Sep 22, 2022
Theory of Computation
number-of-dfa
theory-of-computation
+
–
0
votes
2
answers
10
DFA
on seeing a dfa how can we predict the number of states in it?
on seeing a dfa how can we predict the number of states in it?
Manuj_og
224
views
Manuj_og
asked
May 2, 2023
Theory of Computation
theory-of-computation
finite-automata
number-of-states
+
–
1
votes
2
answers
11
Convert given DFA to regular expression, I think it's just that 2 is dead state and thus can be eliminated.
Shaina Singh
806
views
Shaina Singh
asked
Jul 30, 2023
Theory of Computation
theory-of-computation
number-of-dfa
regular-expression
+
–
0
votes
1
answer
12
Can someone help me for better understanding.
Tarungujral89
304
views
Tarungujral89
asked
May 4, 2023
Theory of Computation
theory-of-computation
regular-expression
number-of-dfa
+
–
2
votes
1
answer
13
GATE ECE 2023 | GA Question: 3
What is the smallest number with distinct digits whose digits add up to $45?$ $123555789$ $123457869$ $123456789$ $99999$
What is the smallest number with distinct digits whose digits add up to $45?$$123555789$$123457869$$123456789$$99999$
admin
1.7k
views
admin
asked
May 20, 2023
Quantitative Aptitude
gateece-2023
quantitative-aptitude
number-theory
+
–
0
votes
2
answers
14
MadeEasy
Consider the following deterministic finite automation Let S denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. Then which of the following strings is/are in S that are accepted by M. 01110111 01111010 10101010 01110110
Consider the following deterministic finite automation Let S denote the set of eight bit strings whose second, third, sixth andseventh bits are 1. Then which of th...
Rohit Chakraborty
448
views
Rohit Chakraborty
asked
Apr 9, 2023
Theory of Computation
made-easy-test-series
theory-of-computation
number-of-dfa
+
–
5
votes
2
answers
15
GATE Electrical 2021 | GA Question: 4
Which one of the following numbers is exactly divisible by $\left ( 11^{13} +1\right )$? $11^{26} +1$ $11^{33} +1$ $11^{39} -1$ $11^{52} -1$
Which one of the following numbers is exactly divisible by $\left ( 11^{13} +1\right )$?$11^{26} +1$$11^{33} +1$$11^{39} -1$$11^{52} -1$
Arjun
7.2k
views
Arjun
asked
Feb 19, 2021
Quantitative Aptitude
gateee-2021
quantitative-aptitude
number-system
number-theory
+
–
0
votes
0
answers
16
Computational Theory
Give the state diagram of DFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is {0, 1}. {w | accept all string except 11 or 110} {w | w begins with a 11 and ends with a 0} {w | All string accepted except ... w | w contains at least three 0s } { w | w contains the substring 0101, i.e., w = x0101y for some x and y }
Give the state diagram of DFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is {0, 1}. {w | accept all stri...
ahmed5
417
views
ahmed5
asked
Feb 7, 2023
Theory of Computation
theory-of-computation
number-of-dfa
strings
+
–
0
votes
1
answer
17
#GateAppliedCourse-DFA-EpsilonNFA
can we solve it with a minimum of 4 states?
can we solve it with a minimum of 4 states?
Dknights
327
views
Dknights
asked
Nov 19, 2022
Theory of Computation
theory-of-computation
finite-automata
number-of-states
+
–
1
votes
1
answer
18
Theory of Computation
Number of 3 state DFA with designated initial state can be constructed over the alphabet $\sum$ = {0,1,2} with exactly 2 final states is $3^{8}$ B)$3^{9}$ C) $3^{10}$ D) $3^{11}$ Answer is C
Number of 3 state DFA with designated initial state can be constructed over the alphabet $\sum$ = {0,1,2} with exactly 2 final states is$3^{8}$ B)$3^{9}$ C) $3^{10}$ D...
Overflow04
547
views
Overflow04
asked
Oct 30, 2022
Theory of Computation
theory-of-computation
test-series
number-of-dfa
+
–
0
votes
1
answer
19
Conversion of Regular expression to Finite Automata
What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ?
What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ?
dutta18
446
views
dutta18
asked
Sep 21, 2022
Theory of Computation
theory-of-computation
finite-automata
number-of-dfa
+
–
3
votes
4
answers
20
GATE2017 ME-2: GA-3
If $a$ and $b$ are integers and $a-b$ is even, which of the following must always be even? $ab$ $a^{2}+b^{2}+1$ $a^{2}+b+1$ $ab-b$
If $a$ and $b$ are integers and $a-b$ is even, which of the following must always be even?$ab$$a^{2}+b^{2}+1$$a^{2}+b+1$$ab-b$
Arjun
1.6k
views
Arjun
asked
Feb 26, 2017
Quantitative Aptitude
gate2017-me-2
general-aptitude
quantitative-aptitude
number-theory
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register