Register

Search results for dfa

1 votes
2 answers
2
DFA to Regular Expression
Help to Convert DFA in to Regular Expression
Help to Convert DFA in to Regular Expression
User Avatar
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.
User Avatar
0 votes
0 answers
11
Gate 2023
Consider the language L over the alphabet {0, 1}, given below: L = {w ∈ {0, 1}* | w does not contain three or more consecutive 1’s}. The minimum number of states in a Deterministic Finite-State Automaton (DFA) for L is ______ .
Consider the language L over the alphabet {0, 1}, given below:L = {w ∈ {0, 1}* | w does not contain three or more consecutive 1’s}. The minimum number of states in ...
User Avatar
0 votes
1 answer
13
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
1 votes
1 answer
14
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...
User Avatar
0 votes
1 answer
15
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)* ?
User Avatar
1 votes
1 answer
17
Testbook test Series
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 consecutive b’s, overlapping permitted}
What will be the number of non-final states in the minimal DFA for the language L = { the set of strings over alphabet (a.b) containing at least three occurrences of 3 co...
User Avatar
3 votes
2 answers
18
ACE ACADEMY: TOC
How many 2 state DFA’s with designated initial state can be constructed over the alphabet Σ = {a, b} that accept empty language ϕ ? (a) 4 (b) 16 (c) 20 (d) 24
How many 2 state DFA’s with designated initial state can be constructed over the alphabet Σ = {a, b} that accept empty language ϕ ?(a) 4 (b) 16 (c) 20 ...
User Avatar
1 votes
1 answer
19
Classroom notes
PLease help me , i have seen the same questions in many places but didnt understand the solution .
PLease help me , i have seen the same questions in many places but didnt understand the solution .
User Avatar
Page: