Register

what is the regular expression and design dfa and nfa for arthimatic expression

437 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
2
sabir asked Nov 17, 2015
1,607 views
What is the Regular Expression for
The regular expression for the language recognized by the following Finite State Automaton is? $0^* \mid 0^* 1^+$ $0^* \mid 11^*$ $0^* \mid 0^* 1^+ \mid 0^* 1^+ (0+1)^*$ None of these.
The regular expression for the language recognized by the following Finite State Automaton is?$0^* \mid 0^* 1^+$$0^* \mid 11^*$$0^* \mid 0^* 1^+ \mid 0^* 1^+ (0+1)^*$None...
User Avatar
1 votes
1 votes
1 answer
3
Purple asked Jan 28, 2016
14,846 views
Regular expression for all strings starts with ab and ends with bba is.
Regular expression for all strings starts with ab and ends with bba is. a) aba*b*bba b) ab(ab)*bba c) ab(a+b)*bba d) All of the mentioned Doubt: starting with 'ab' and ending with 'bba', so 'abba' should also be accepted right?
Regular expression for all strings starts with ab and ends with bba is.a) aba*b*bbab) ab(ab)*bbac) ab(a+b)*bbad) All of the mentionedDoubt: starting with 'ab' and ending ...
User Avatar
1 votes
1 votes
1 answer
4
sripo asked Nov 6, 2018
3,044 views
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
User Avatar
Link Copied!