Register

MADE EASY

1,680 views
1 votes
1 votes
A minimum state deterministic finite automaton accepting the language L={w∣w∈{0,1}} where fifth symbol from the right is 0 has how many states?
User Avatar

1 Answer

0 votes
0 votes

In this way you can solve any such question like nth symbol from rhs is 0/1

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

Related questions

0 votes
0 votes
1 answer
1
Souvik33 asked Dec 27, 2022
491 views
Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False
The following language regularL*, where L={ $0^{{m}^{2}} | m\leq 3$ }TrueFalse
User Avatar
0 votes
0 votes
1 answer
2
Luci3671 asked Nov 11, 2022
271 views
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
0 votes
0 answers
3
abhinowKatore asked Mar 7, 2022
481 views
MADE EASY 2022 Work book -Theory of Computation
Which of the following pairs of string belonging to Σ* are distinguishable by the following dfa?
Which of the following pairs of string belonging to Σ* are distinguishable by the following dfa?
User Avatar
Link Copied!