Register

Doubt-DFA

1,428 views
0 0 votes

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

6 Answers

0 0 votes
The grammar in question is any string containing at least 1 zero. So, the complement would be the collection of string containing no zero at all.
0 0 votes
1* and it is type 3 grammar bcz complement of regular language is also regular
0 0 votes
regular language is closed under complementation.so it will be regular

and grammar generated by its complement will be strings not containing 0.
0 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.
Voting & Accepting an answer helps improve the community
← Previous · self doubtNext → · Combinatorics-Self D...
← Previous in category · DoubtNext in category → · Regular Expression
Position:
Show:

Related questions

1 1 vote
1 1 answer
2.1k
2.1k views
Bhaskar Singh asked Feb 20, 2019
2,107 views
Self Doubt - Confusion on language represented by DFA and NFA
If a DFA "D" have symbol {0,1,2} and NFA "N" have symbol {0,1} but both are representing strings ending with 01 and whole string only contain {0,1} then can we say L(N) =...
0 0 votes
1 answers 1 answer
1.2k
1.2k views
Lakshman Bhaiya asked Dec 27, 2018
1,225 views
Self doubt TOC DFA
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 1 vote
2 2 answers
4.0k
4.0k views
aditi19 asked Dec 14, 2018
4,022 views
DFA doubt
DFA in which 01 and 10 have equal number of occurrences
3 3 votes
1 1 answer
3.4k
3.4k views
aditi19 asked Dec 10, 2018
3,439 views
Reversal of DFA doubt
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