Register

Recent questions tagged finite-automata

0 votes
2 answers
61
Theory of Computation Self Doubt
Construct finite automaton corresponding to regular expression (a + b)*cd*e
Construct finite automaton corresponding to regular expression (a + b)*cd*e
User Avatar
0 votes
2 answers
62
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
User Avatar
0 votes
1 answer
63
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...
User Avatar
0 votes
2 answers
64
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?
User Avatar
0 votes
1 answer
67
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) .
User Avatar
0 votes
1 answer
68
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
User Avatar
3 votes
1 answer
71
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}$) ?
User Avatar
0 votes
1 answer
72
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?
User Avatar
0 votes
1 answer
74
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)...
User Avatar
1 votes
1 answer
78
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.
User Avatar
0 votes
0 answers
79
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?
User Avatar
0 votes
1 answer
81
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)^+
User Avatar
0 votes
1 answer
82
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
User Avatar
0 votes
1 answer
83
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 ?
User Avatar
0 votes
0 answers
84
Theory of computation
Can finite automata do multiplication.
Can finite automata do multiplication.
User Avatar
Page: