Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Ferox
2
answers
1
How to do questions of ToC like finding min. No. Of states , min. No. Of substring etc ?
447
views
commented
Oct 11, 2022
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
0
answers
2
How to practice ToC precisely ? Like I am unable to know transitions for intermediate states in dfa design , it takes time and sometimes I am unable to answer !! Ex – Σ ={a,b} design dfa for : 1.exactly 2a and 2b 2. Minimum 2a and minimum 2b In these thinking about intermediate transitions for possible acceptable strings takes time and sometimes i get wrong answer !!! So what to do to get exact accurate answer with min. Of states in such type of ques. ?
265
views
asked
Oct 9, 2022
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
0
answers
3
Time complexity
1. for ( i = 1 ; i <= n ; i++) { for ( j= 1 ; j <= i; j++) { for ( k = 1 ; k <= j ; k++) cout<<"a"; } } Here , complexity = O(n³) 2. for ( i = 1 ; i <= n ; i=i*2) { for ( j = 1 ; j <= i ; j++) cout<< ... = O(n) . But I am getting O(2^n) (A gp was formed , first term = 1 = 2^0 , last term was 2^n so sum is 2^(n+1) which gives complexity as 2^n)
1. for ( i = 1 ; i <= n ; i++){ for ( j= 1 ; j <= i; j++){ for ( k = 1 ; k <= j ; k++) cout<<"a";}} Here , complexity = O(n³) 2.for ( i = 1 ; i <= n ...
523
views
commented
Sep 8, 2022
Algorithms
algorithms
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register