621 views
0 votes
0 votes

what is the grammar generated by the complement of this DFA and what is the type?

6 Answers

0 votes
0 votes
The compliment of a regular language is always regular.The compliment of a finite language which is included in the regular languages will always be infinite but it will be in the regular set.To obtain the compliment of any DFA ,Just interchange the final and non-final states.

Related questions

0 votes
0 votes
1 answer
2
Lakshman Bhaiya asked Dec 27, 2018
543 views
Construct a minimal DFA which accepts set of all strings over {a,b}, such that$1)$Second symbol from $RHS$ should be $‘a’$$2)$Third symbol from $RHS$ should be $‘a�...
1 votes
1 votes
2 answers
3
aditi19 asked Dec 14, 2018
1,443 views
DFA in which 01 and 10 have equal number of occurrences
3 votes
3 votes
1 answer
4
aditi19 asked Dec 10, 2018
2,252 views
in reversal of DFA if there are more than one final states then which one will be made the initial state? a DFA can have only one initial state