Register

MadeEasy Workbook: Theory of Computation - Finite Automata

• edited by
1,318 views

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · prev gateNext → · madeeasy#workbook
← Previous in category · test seriesNext in category → · madeeasy#workbook
Position:
Show:

Related questions

1 1 vote
2 2 answers
1.5k
1.5k views
charul asked Oct 6, 2017
1,545 views
MadeEasy Workbook: Theory of Computation - Finite Automata
Any given transition diagram has an equivalenta) regular expressionb) NDFSMc) DFSMd) all of these
0 0 votes
1 1 answer
1.1k
1.1k views
Jyoti Kumari97 asked Feb 16, 2019
1,112 views
MadeEasy WorkBook: Thoery of Computation - Finite Automata
Consider the following finite state automata M.Which of the following regular expressions denotes the set of words accepted by $M$ ?(a) $011(0+1)^{\star}$(b) $1 * 00 * 11...
0 0 votes
1 1 answer
885
885 views
Pranav Madhani asked Oct 26, 2017
885 views
MadeEasy WorkBook: Theory of Computation - Minimum State Automata
IF a number is divisible by say any integer X then what will be the minimum states required in DFA?
0 0 votes
2 answers 2 answers
2.2k
2.2k views
Jyoti Kumari97 asked Feb 16, 2019
2,211 views
MadeEasy WorkBook: Theory of Computation - Regular Expression
Given answer is option c. Can anyone tell me how? Postal Study PackagStudent'sAssignments11 Consider a regular expression $\mathrm{R}=(\mathrm{a}+\varepsilon)\left(\mathr...