Recent questions tagged goclasses-cs-dpp-day-103

6 6 votes
2 2 answers
304
304 views
If the regular set $\mathbf{A}$ is represented by $A=(b+a b)^*(a+\epsilon)$ and the regular set $\mathbf{B}$ is represented by $B=\left(b^* a b^*\right)^*(a+\epsilon)$, w...
5 5 votes
3 3 answers
374
374 views
The string 'babaa' does not belong to the set represented by$\left(a^* b\right)^*(a+b)$ $b\left(a^* b^*\right)^* a$ $b\left(a+b^* a\right)^*$ $\left(b^* a\right)^*\left(a...
3 3 votes
3 3 answers
335
335 views
Which two of the following four regular expressions are equivalent over the alphabet $\{a, b\}$ ? ( $\epsilon$ is the empty string).i. $(a+b)^*$ii. $a^*\left(b a^*\right)...
2 2 votes
1 1 answer
288
288 views
A finite state machine is represented by the diagram below. It has two states, $Q_{\text {even }}$ (the start state) and $Q_{\text {odd }}$. The machine takes a binary st...
5 5 votes
4 4 answers
473
473 views
Consider a Deterministic Finite Automaton (DFA) defined as follows:States $(Q):\left\{q_0, q_1, q_2, q_3, q_4\right\}$ Alphabet ( $\Sigma$ ): $\{a, b\}$ Start State: $q_0...
To see more, click for the full list of questions or popular tags.