Register

Michael Sipster Theory of Computation

• retagged by
163 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
baofbuiafbi asked Nov 14, 2023
150 views
Michael Sipster Decidability Problems
Prove L = {F | F is a boolean formula and F evaluates to true on every asignment" is decidable (include algorithm and running time in big o notation)
Prove L = {F | F is a boolean formula and F evaluates to true on every asignment" is decidable (include algorithm and running time in big o notation)
User Avatar
1 votes
1 votes
1 answer
2
Overflow04 asked Oct 30, 2022
554 views
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
3 votes
3 votes
3 answers
3
Hirak asked May 22, 2019
1,403 views
Ace Test Series: Theory Of Computation - Finite Automata
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language? $4$ $16$ $20$ $24$
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language?$4$$1...
User Avatar
0 votes
0 votes
1 answer
4
Mudita asked Sep 19, 2018
452 views
Theory of computation dfa construction
$\Large L = \left \{ a^{m^n} | n \geq 1, m > n \right \}$ What is the Minimum no.of states in a DFA which accept this language
$\Large L = \left \{ a^{m^n} | n \geq 1, m n \right \}$What is the Minimum no.of states in a DFA which accept this language
User Avatar
Link Copied!