Theory of ComputationTU Board 2076
Give the regular expressions for following language over alphabet 0, 1. 1. Set of all strings with 2^nd symbol from right is 1. 1. Set of all strings starting with 00 or 11 and ending with 10 or 01.
5Give the regular expressions for following language over alphabet {0, 1}.
- Set of all strings with 2^nd symbol from right is 1.
- Set of all strings starting with 00 or 11 and ending with 10 or 01.
This question was also asked in TU Board 2078. Read the worked answer →
Discussion
Loading…
More Theory of Computation questions
Show that, For any NFA N=(Q, ∑, δ, q0, F) accepting language L=∑, There is a DFA D= (Q', ∑', q0′, δ', F') accepting the same language L.TU Board 207910State and prove the Pumping Lemma for regular languages. How can you show with example that pumping lemma is used to prove that a given language is not a…TU Board 207910Given the following expression grammar for simple arithematic expression with operator + and . E→ E+T T T → T+F F F → (E) a Remove the left recursion from…TU Board 207910Explain the ε closure of states on an ε NFA with suitable examples.TU Board 20795Convert the following regular expression into equivalent Finite Automata a) (0+1) 10(1+0) b) 1 0(0+1) 1TU Board 20795Define the term: Parse Tree, left most and right most derivation, sentential form and ambiguity with example.TU Board 20795