Let w = xyz, y is the middle portion and |y| > 0. Repeating y zero or — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2022 paper

Module 1: Introduction & Regular Languages

20222m

Let $w = xyz$ , $y$ is the middle portion and $|y| > 0$ . Repeating $y$ zero or more times before checking membership in $L$ is known as:

(i) Generating
(ii) Pumping
(iii) Producing
(iv) None of the above

Search Google Ask AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYState the pumping lemma for context-free languages.20237m Formal Language & Automata TheoryA minimum state deterministic FA accepting the language L = \{w \mid w \in \{0, 1\}^*\} where number of 0's and 1's in w are divisible by 3 and 5 respectively, has (i) 15 states (ii) 11 states (iii) 10 states (iv) 9 states20212m FORMAL LANGUAGE & AUTOMATA THEORYA minimum state deterministic FA accepting the language: L = \{ w \mid w \in \{0,1\}^* \} where the number of 0's and 1's in w are divisible by 3 and 5 respectively, has: (i) 15 states (ii) 11 states (iii) 10 states (iv) 9 states20232m Formal Language & Automata TheoryWrite a short note on: Pumping lemma for CFL20203.5m

PreviousThe minimum number of transitions to reach the final state as per the regular expression: \{a, b\}^* baaa is: (i) 4 (ii) 5 (iii) 6 (iv) 3 NextA Turing machine that is able to simulate other Turing machines is called: (i) nested Turing machine (ii) universal Turing machine (iii) counter machine (iv) None of the above