edited by
934 views
0 votes
0 votes

Complementation of DFA works for all DFA is it true ?

Given DFA, a should be followed by a 'b',

In the complementation of this DFA the string aab is getting accepted 

a is getting followed by a 'b'

edited by

1 Answer

0 votes
0 votes
at most one possibility does not occur , Like, when will be   ∀ false ? when we show a single counter example , right? and yes the complement of  "every a is followed by a b"  is true , when we show a single counter that that does not occur

Related questions

0 votes
0 votes
1 answer
2
Souvik33 asked Nov 7, 2022
352 views
MSQ The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s)010110
0 votes
0 votes
2 answers
3
rohankrishan asked Jun 29, 2022
248 views
Example: 11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3. This machine required at least six states.
0 votes
0 votes
0 answers
4
koushriek asked May 19, 2022
1,361 views
Examples of accepted words: 1011, 101101, 1111Example of non-accepted words: 101, 1001, 010The solution says the min-DFA contains 5 states but I could only do it in 4. Am...