542 views

2 Answers

Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
151
151 views
Kaustubh_Dhyani asked Aug 21
151 views
Que-1: Draw a deterministic finite automate which either starts with 01 or end with 01 of a string containing 0, 1 in it, e.g., 01010100 but not 000111010.
0 0 votes
2 2 answers
375
375 views
Om_Prakash_Kewtiya asked Oct 29, 2025
375 views
construct a D.F.A which accepts all those strings which are start and end with 'aa' over sigma {a,b}
1 1 vote
1 answers 1 answer
1.1k
1.1k views
stillhere asked Sep 10, 2023
1,099 views
Consider the set of all binary strings where the difference between the number of 0’s and number of 1’s is even. The minimum number of states in a DFA that accepts the gi...