Register

ISI CSB 2018 Question number C4.

319 views
0 votes
0 votes
C4. Construct a Deterministic Finite Automaton (DFA) to accept

L={s1s2.....sn | n >=1; for each i=1,2,.....n, si € {0,1}, and the number of 1's minus the number of 0's in s1s2....si is zero,one or two}

For example, the DFA should accept 11 or 1100 but not 1110.
User Avatar

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

0 votes
0 votes
1 answer
2
shivanisrivarshini asked Mar 20, 2018
481 views
ISI CSB 2017
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes: $\text{D K E F B G L M H I J C A.}$ For each node of $T$ ... $T$.
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes:$$\text{D K E F B G L M H I J C A.}$$For each node of $T$, the deg...
User Avatar
0 votes
0 votes
0 answers
4
shivanisrivarshini asked Mar 20, 2018
458 views
ISI CSB 2017
Consider the Boolean function $F(x_1,x_2,......,x_{10})$ realised by the following combinational circuit. $\text{Determine the number of input combinations for which the output function F realised by }$ $\text{ the circuit becomes true (logic 1)}$ I'm getting $940$ Input combinations
Consider the Boolean function $F(x_1,x_2,......,x_{10})$ realised by the following combinational circuit.$\text{Determine the number of input combinations for which the o...
User Avatar
Link Copied!