Register

Doubt-DFA

691 views
0 votes
0 votes

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

User Avatar

6 Answers

1 votes
1 votes
require R.E=$\epsilon$ +1.1*

and grammer is S->1S/1/$\epsilon$ and it is right linear grammer.
User Avatar
0 votes
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.
User Avatar
0 votes
0 votes
1* and it is type 3 grammar bcz complement of regular language is also regular
User Avatar
0 votes
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.
User Avatar
Page:
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

740
views
1 answers
1 votes
Bhaskar Singh asked Feb 20, 2019
740 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) =...
User Avatar
607
views
1 answers
0 votes
Lakshman Bhaiya asked Dec 27, 2018
607 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�...
User Avatar
1.7k
views
2 answers
1 votes
aditi19 asked Dec 14, 2018
1,691 views
DFA doubt
DFA in which 01 and 10 have equal number of occurrences
User Avatar
2.3k
views
1 answers
3 votes
aditi19 asked Dec 10, 2018
2,333 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
User Avatar
Link Copied!