PyQdeck LogoPyQdeckSubjects
Back to the 2022 paper

Module 1: Introduction, Regular languages and finite automata

20227m

Prove using pumping lemma for regular languages that the language {0n/n is a perfect square}\{ 0^n / n \text{ is a perfect square} \} is not regular.

Search GoogleAsk AI

Similar questions

Formal Language & Automata TheoryUsing Pumping Lemma, prove that the language L = \{0^{n}1^{n} \mid n \ge 0\} is not regular.20257mFORMAL LANGUAGE & AUTOMATA THEORYProve the pumping lemma for regular languages.20247mFORMAL LANGUAGE & AUTOMATA THEORYShow that the language: L = \{ a^{n^2} b^n \mid n \ge 0 \} is not regular.20227mFORMAL LANGUAGE & AUTOMATA THEORYUse the pumping lemma to prove that the language L = \{a^n b^n : n \ge 1\} is not regular.20257m
PreviousDefine deterministic pushdown automata. Explain with an example.NextConvert the following DFA to regular expression using the state elimination technique. | State/input | 0 | 1 | |---|---|---| | \to *p | s | p | | q | p | s | | r | r | q | | s | q | r |