Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Aditi0103
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Aditi0103
4
answers
1
GATE CSE 1993 | Question: 27
Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet $\{a,b\}$, such that no string has $3$ consecutive occurrences of the letter $b$.
Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet $\{a,b\}$, such that no string has $3$ consecutive occurre...
12.8k
views
answered
Jul 20, 2020
Theory of Computation
gate1993
theory-of-computation
finite-automata
easy
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register