Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Some useful problems
Recent questions tagged finite-automata
0
votes
0
answers
91
Regular expression
Can we simplify a*+a*b(d+ca*b)*ca* ? Where a,b,c,d are regular expression.
Can we simplify a*+a*b(d+ca*b)*ca* ? Where a,b,c,d are regular expression.
nbhatt
361
views
nbhatt
asked
Sep 21, 2022
Theory of Computation
theory-of-computation
finite-automata
regular-expression
+
–
0
votes
1
answer
92
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
418
views
dutta18
asked
Sep 21, 2022
Theory of Computation
theory-of-computation
finite-automata
number-of-dfa
+
–
0
votes
1
answer
93
Regular expression
What will be the regular expression for following fa using recurrence relation method.
What will be the regular expression for following fa using recurrence relation method.
nbhatt
340
views
nbhatt
asked
Sep 21, 2022
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
2
votes
3
answers
94
Regular expression
Is (a+ab*b)* and (ab*)* same or not?
Is (a+ab*b)* and (ab*)* same or not?
nbhatt
728
views
nbhatt
asked
Sep 15, 2022
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
0
votes
1
answer
95
#Toc #regularexpression
How to convert (a+b)* into a minimal Dfa
How to convert (a+b)* into a minimal Dfa
Srken
306
views
Srken
asked
Sep 4, 2022
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
2
votes
1
answer
96
TIFR CSE 2022 | Part A | Question: 13
Consider the transition system shown in the figure below with the initial state $s_1$. A token is initially placed at $s_1$, and it moves to $s_2$ with probability $\frac{2}{3}$, and to $s_3$ with probability $\frac{1}{3}$. From $s_2$ and $s_3$, the token always ... appear in the run? $\frac{1}{7}$ $\frac{2}{7}$ $\frac{3}{7}$ $\frac{5}{7}$ None of the above
Consider the transition system shown in the figure below with the initial state $s_1$. A token is initially placed at $s_1$, and it moves to $s_2$ with probability $\frac...
admin
384
views
admin
asked
Sep 1, 2022
Theory of Computation
tifr2022
theory-of-computation
finite-automata
probability
+
–
1
votes
2
answers
97
Draw a DFA (Deterministic Finite Automation) in which first two bits are the same as the last two bits
Examples of what works:01101101101101101110101010100101
rohankrishan
558
views
rohankrishan
asked
Jun 30, 2022
Theory of Computation
finite-automata
theory-of-computation
+
–
0
votes
1
answer
98
Draw a DFA (Deterministic Finite Automation) that has a its thrid to last digit as a 1
Examples that work: 100, 0000000101,110101010101 This DFA requires at least 8 states
Examples that work: 100, 0000000101,110101010101 This DFA requires at least 8 states
rohankrishan
443
views
rohankrishan
asked
Jun 30, 2022
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
2
answers
99
Draw a DFA (Deterministic Finite Automation) that has a total number of zeros in the string divisble by two and three.
Example: 11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3. This machine required at least six states.
rohankrishan
230
views
rohankrishan
asked
Jun 29, 2022
Theory of Computation
theory-of-computation
finite-automata
+
–
3
votes
1
answer
100
GO Classes Test Series 2023 | Theory of Computation | Test 2 | Question: 8
Consider the following non-deterministic finite automaton(NFA), where $\Sigma = \{a, b, c\}.$ How many strings of length $6$ are accepted by the given NFA over the alphabet $\Sigma=\{\mathrm{a}, \mathrm{b}, \mathrm{c}\}$ ?
Consider the following non-deterministic finite automaton(NFA), where $\Sigma = \{a, b, c\}.$How many strings of length $6$ are accepted by the given NFA over the alphabe...
GO Classes
538
views
GO Classes
asked
Jun 22, 2022
Theory of Computation
goclasses2024-toc-2-weekly-quiz
numerical-answers
goclasses
theory-of-computation
finite-automata
2-marks
+
–
4
votes
2
answers
101
GO Classes Test Series 2023 | Theory of Computation | Test 1 | Question: 14
Let $L$ be the language accepted by the following non-deterministic finite automaton with $\epsilon$-transitions: The number of states in the minimal DFA that accepts the language that is recognized by the above NFA over alphabet $\{a\},$ is ________
Let $L$ be the language accepted by the following non-deterministic finite automaton with $\epsilon$-transitions:The number of states in the minimal DFA that accepts the ...
GO Classes
503
views
GO Classes
asked
Jun 9, 2022
Theory of Computation
goclasses2024-toc-1-weekly-quiz
numerical-answers
goclasses
theory-of-computation
finite-automata
minimal-state-automata
2-marks
+
–
2
votes
2
answers
102
GO Classes Test Series 2023 | Theory of Computation | Test 1 | Question: 16
For the deterministic finite automaton $M$ with state set $\{0,1,2\}$, alphabet of input symbols $\{a, b\}$, initial state $0 ,$ ... None of the above
For the deterministic finite automaton $M$ with state set $\{0,1,2\}$, alphabet of input symbols $\{a, b\}$, initial state $0 ,$ accepting states 1 and 2 , and next-state...
GO Classes
311
views
GO Classes
asked
Jun 9, 2022
Theory of Computation
goclasses2024-toc-1-weekly-quiz
goclasses
theory-of-computation
finite-automata
regular-expression
2-marks
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
35
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register