Assume that a regular language L is provided to you as a DFA M(\{Q, \S — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2019 paper

Module 1: Introduction, Regular languages and finite automata

20197m

Assume that a regular language $L$ is provided to you as a DFA $M(\{Q, \Sigma, \delta, q_0, F\})$ . How would you check whether $L$ is infinite?

Search Google Ask AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYA language is said to be recursively enumerable if it is accepted by a (i) DFA (ii) Turing Machine (iii) PDA (iv) Linear Bounded Automaton20252m Formal Language & Automata TheoryLet \Sigma = \{0, 1\}. Let L be the language that consists of strings having either 01 repeated one or more times or 010 repeated one or more times. Is L regular? Explain.20197m FORMAL LANGUAGE & AUTOMATA THEORYWhich of the following languages is NOT regular? (i) {a^n b^n | n \ge 0} (ii) {a, b}* (iii) Finite languages (iv) Languages accepted by DFA20252m Formal Language & Automata TheoryDefinition of a language L with alphabet \{a\} is given as L = \{a^{nk} \mid k > 0, \text{ and } n \text{ is a positive integer constant}\} What is the minimum number of states needed in a DFA to recognize L? (i) k + 1 (ii) n + 1 (iii) 2^{n + 1} (iv) 2^{k + 1}20202m

PreviousLet \Sigma = \{0, 1\}. Let L be the language that consists of strings having either 01 repeated one or more times or 010 repeated one or more times. Is L regular? Explain.NextDesign a push-down automata for accepting the string for the language L = \{WW^R \mid W \in \{a, b\}^*\} by the empty stack as well as final state.