Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for compound-automata
1
votes
4
answers
1
Minimal FA
What is the number of states in a minimal FA which accepts all strings over (0,1)* where every string starts with 100 and the length of the string is congruent to 1(mod4) I am getting 11 states. Ans given is 8. While doing the cross product , is it ensured that , I will get the minimal DFA ? or do I have to minimise after the cross product ?
What is the number of states in a minimal FA which accepts all strings over (0,1)* where every string starts with 100 and the length of the string is congruent to 1(mod4)...
chat28
711
views
chat28
asked
Jan 17, 2016
Theory of Computation
theory-of-computation
compound-automata
+
–
0
votes
1
answer
2
Compound automata
Construct the dfa that accepts all the strings of a's and b's where no of a's is even OR no of b's is odd.
Construct the dfa that accepts all the strings of a's and b's where no of a's is even OR no of b's is odd.
Arnabi
1.4k
views
Arnabi
asked
Jan 13, 2017
Theory of Computation
theory-of-computation
compound-automata
+
–
1
votes
0
answers
3
construct compund FA
Construct Compound FA that accept strings Even number of a's and ODD number of B's
Construct Compound FA that accept strings Even number of a's and ODD number of B's
pC
316
views
pC
asked
Jul 22, 2016
Theory of Computation
compound-automata
theory-of-computation
+
–
5
votes
2
answers
4
How to construct compound Automata ? and find the no of states in minimal FA ?
Construct Minimal FA that accept all binary strings ends with 01 AND length of string is EVEN . Also find no of states in its minimal FA
Construct Minimal FA that accept all binary strings ends with 01 AND length of string is EVEN .Also find no of states in its minimal FA
pC
2.7k
views
pC
asked
Jan 2, 2016
Theory of Computation
compound-automata
minimal-state-automata
+
–
0
votes
1
answer
5
Two languages reducible to each other in polynomial time. Which is false option for them?
If Language L1 is reducible to L2 and L2 reducible to L1, then shouldn't they both be Recursively Enumerable Languages? I am really confused with the option given. Source : testbook.com live test on 3rd January, 2016
If Language L1 is reducible to L2 and L2 reducible to L1, then shouldn't they both be Recursively Enumerable Languages? I am really confused with the option given.Source ...
Utk
676
views
Utk
asked
Jan 4, 2016
Theory of Computation
recursive-and-recursively-enumerable-languages
normal
compound-automata
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register