Show that L = \text{palindrome over } \{a, b\} is not regular. — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2019 paper

Module 1: Introduction, Regular languages and finite automata

20197m

Show that $L = \text{palindrome over } \{a, b\}$ is not regular.

Search Google Ask AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYShow that the language of palindromes over \{a, b\} is not regular.20227m Formal Language & Automata TheoryWrite the context-free grammar to create palindrome over \{a, b\}.20207m Formal Language & Automata TheoryDesign a turing machine that accepts all palindromes over \Sigma = \{a, b\}.20207m Formal Language & Automata TheoryDesign ANPDA for accepting the string L = \{\text{set of all palindrome over } \{a, b\}\} by the empty stack and by final state.20207m

PreviousProve that the language L = \{a^{i^2} \mid i \ge 1\} is not context-free language.NextConsider the following language: L = \{a^m b^{2n} c^{3n} d^p \mid p > m \text{ and } m, n \ge 1\} Write a context-free grammar to generate L and write shortest string in L.