Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Some useful problems
Recent questions tagged finite-automata
0
votes
2
answers
61
Theory of computation Self doubt
Construct NFA for the set of strings Σ={0, 1} of alternate 0's and 1's
Construct NFA for the set of strings Σ={0, 1} of alternate 0's and 1's
gateexplore
232
views
gateexplore
asked
Jun 11, 2023
Theory of Computation
theory-of-computation
self-doubt
finite-automata
+
–
0
votes
1
answer
62
TOC self doubt
Construct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by an odd number of 1's and ending with any number of 2's. Please give the answer with explanation.
Construct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by an odd number of 1's and ending with any number of 2's. Please give the answ...
gateexplore
442
views
gateexplore
asked
Jun 11, 2023
Theory of Computation
theory-of-computation
finite-automata
self-doubt
+
–
0
votes
2
answers
63
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
223
views
Manuj_og
asked
May 2, 2023
Theory of Computation
theory-of-computation
finite-automata
number-of-states
+
–
1
votes
2
answers
64
Design a DFA from the given RE [ a (a* ba* ba*) * ]
manjula66
633
views
manjula66
asked
Apr 15, 2023
Compiler Design
regular-expression
finite-automata
+
–
0
votes
5
answers
65
MadeEasy
Match List-l with List-|l and select the correct answer using the codes given below the lists: List-I List-II A. Regular grammar 1. Pushdown automaton B. Context free grammar 2. Linear bounded automaton C Unrestricted grammar 3. Deterministic finite . D. Context sensitive grammar 4. Turing machine Codes: A B C D (a) 3 1 2 4 (b) 3 1 4 2 Which of the options are correct and why?
Match List-l with List-|l and select the correct answer using the codes given below the lists:List-I List-IIA. Regular grammar 1. Pushdown a...
Rohit Chakraborty
644
views
Rohit Chakraborty
asked
Apr 9, 2023
Theory of Computation
made-easy-test-series
finite-automata
+
–
0
votes
1
answer
66
Finite automata and formal languages
Write input set, strings and language for the following 1) The set of all strings with three consecutive O's over (0,1) .
Write input set, strings and language for the following 1) The set of all strings with three consecutive O's over (0,1) .
upasesharanesh
344
views
upasesharanesh
asked
Apr 6, 2023
Theory of Computation
finite-automata
regular-language
regular-expression
strings
+
–
0
votes
1
answer
67
Regular Languages
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵ a) an infinite number of solutions b) a finite number of solutions c) is always unique d) none
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵa) an infinite number of solutionsb) a finite number of solutionsc) is always uniqued) none
practicalmetal
379
views
practicalmetal
asked
Mar 25, 2023
Theory of Computation
regular-language
theory-of-computation
finite-automata
+
–
0
votes
1
answer
68
An Introduction to Formal Languages and Automata,6th edition,Exercise 2.3 Q2.
Convert the nfa in Exercise 13, Section 2.2, into an equivalent dfa.
Convert the nfa in Exercise 13, Section 2.2, into an equivalent dfa.
Silver_Reaper
691
views
Silver_Reaper
asked
Jan 28, 2023
Theory of Computation
theory-of-computation
peter-linz
finite-automata
+
–
0
votes
0
answers
69
An Introduction to Formal Languages and Automata Peter Linz 6th Edition.Exercise 2.1 4 d,e
For Σ = {a, b}, construct dfa’s that accept the sets consisting of: (d) all strings with at least one b and exactly two a’s. (e) all the strings with exactly two a’s and more than three b’s.
For Σ = {a, b}, construct dfa’s that accept the sets consisting of:(d) all strings with at least one b and exactly two a’s.(e) all the strings with exactly two a’s...
Silver_Reaper
394
views
Silver_Reaper
asked
Jan 24, 2023
Theory of Computation
theory-of-computation
peter-linz
finite-automata
+
–
3
votes
1
answer
70
DFA | Madeeasy TOC
Please explain what is difference between $\overline{L(N)}$ and $L(\overline{N}$) ?
Please explain what is difference between $\overline{L(N)}$ and $L(\overline{N}$) ?
abhinowKatore
551
views
abhinowKatore
asked
Jan 14, 2023
Theory of Computation
theory-of-computation
finite-automata
test-series
+
–
0
votes
1
answer
71
Class Test AFLL Revision
How many states does the DFA and NFA constructed for the “set of all binary strings where the second last symbol will never be a 1” have?
How many states does the DFA and NFA constructed for the “set of all binary strings where the second last symbol will never be a 1” have?
dawndarcy
521
views
dawndarcy
asked
Jan 12, 2023
Others
finite-automata
number-of-dfa
+
–
0
votes
0
answers
72
Testbook Chapter Test on Finite Automata (CT: 19)
Which of the following statements is/are true? The language denoted by the regular expression (ϕ*)* is ϵ The language denoted by the regular expression a ϕ is ϕ The regular expression for the language L={vuv|v,u∈{a,b}*,|v|≤3 } is L=(a ... it will still denote an empty set, right? Whereas, epsilon (ϵ) is not an empty set. And option 4 is True, right?
Which of the following statements is/are true?The language denoted by the regular expression (ϕ*)* is ϵThe language denoted by the regular expression a ϕ is ϕThe regu...
Rajsukh Mohanty
391
views
Rajsukh Mohanty
asked
Jan 6, 2023
Theory of Computation
finite-automata
theory-of-computation
+
–
0
votes
1
answer
73
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
M_Umair_Khan42900
785
views
M_Umair_Khan42900
asked
Dec 29, 2022
Theory of Computation
theory-of-computation
regular-language
regular-expression
finite-automata
+
–
0
votes
0
answers
74
For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular. a) (0²ⁿ | n ≥ 1) Answer: b) String over the decimal alphabets (0,1,2....9) with characters in sorted orders. c) The set of all even binary numbers
For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular.a) (0²ⁿ |...
M_Umair_Khan42900
234
views
M_Umair_Khan42900
asked
Dec 29, 2022
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
1
votes
1
answer
75
Write regular expression to denote a language L a) String which begin or end with either 00 or 11. b) The set of all strings, when viewed as binary representation of integers, that are divisible by 2. c) The set of all strings containing 00. d) String not containing the substring 110.
Write regular expression to denote a language La) String which begin or end with either 00 or 11.b) The set of all strings, when viewed as binary representation of intege...
M_Umair_Khan42900
2.2k
views
M_Umair_Khan42900
asked
Dec 29, 2022
Theory of Computation
theory-of-computation
regular-expression
finite-automata
pushdown-automata
minimal-state-automata
computer
+
–
0
votes
1
answer
76
Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False
The following language regularL*, where L={ $0^{{m}^{2}} | m\leq 3$ }TrueFalse
Souvik33
490
views
Souvik33
asked
Dec 27, 2022
Theory of Computation
theory-of-computation
finite-automata
regular-language
made-easy-test-series
+
–
1
votes
1
answer
77
DRDO CSE 2022 Paper 2 | Question: 10
Construct a Deterministic Finite Automaton $\text{(DFA)}$ with $5$ states that accepts all strings with $0101$ as a substring.
Construct a Deterministic Finite Automaton $\text{(DFA)}$ with $5$ states that accepts all strings with $0101$ as a substring.
admin
459
views
admin
asked
Dec 15, 2022
Theory of Computation
drdocse-2022-paper2
theory-of-computation
finite-automata
5-marks
descriptive
+
–
0
votes
0
answers
78
Theory Of Computation
Can finite automata do addition, subtraction, and multiplication? Anyone, please explain in detail?
Can finite automata do addition, subtraction, and multiplication?Anyone, please explain in detail?
raja11sep
302
views
raja11sep
asked
Nov 22, 2022
Theory of Computation
finite-automata
+
–
0
votes
1
answer
79
#GateAppliedCourse-DFA-EpsilonNFA
can we solve it with a minimum of 4 states?
can we solve it with a minimum of 4 states?
Dknights
326
views
Dknights
asked
Nov 19, 2022
Theory of Computation
theory-of-computation
finite-automata
number-of-states
+
–
0
votes
1
answer
80
Made easy postal course example problem
What will be the DFA for wxw^r where w belongs to (a,b)^+ and x belongs to (a,b)^+
What will be the DFA for wxw^r where w belongs to (a,b)^+ and x belongs to (a,b)^+
Luci3671
271
views
Luci3671
asked
Nov 11, 2022
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
1
answer
81
Theory Of Computation (NFA/DFA)
**MSQ** The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s) 0 1 01 10
MSQ The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s)010110
Souvik33
351
views
Souvik33
asked
Nov 7, 2022
Theory of Computation
finite-automata
theory-of-computation
easy
+
–
0
votes
1
answer
82
Theory of Computation
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?
moe12leb
312
views
moe12leb
asked
Nov 5, 2022
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
0
votes
0
answers
83
Theory of computation
Can finite automata do multiplication.
Can finite automata do multiplication.
Overflow04
310
views
Overflow04
asked
Oct 31, 2022
Theory of Computation
theory-of-computation
self-doubt
finite-automata
+
–
1
votes
2
answers
84
#MADE EASY
Is this statement right or wrong? A DFA does not contain a dead configuration. and what is the mean of dead configuration exactly?
Is this statement right or wrong?A DFA does not contain a dead configuration.and what is the mean of dead configuration exactly?
Dknights
1.5k
views
Dknights
asked
Oct 27, 2022
Theory of Computation
finite-automata
theory-of-computation
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
35
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register