(a) An identifier in a programming language consists of upto six letters and digits of which the first character must be a letter. Derive a regular […]

Let LD be the set of all languages accepted by a PDA by final state and LE the set of all languages accepted by empty stack. Which of […]

Show that the language L = {xcx| x ∈ {0,1}* and c is a terminal symbol} is not context free, c is not 0 or 1. […]

Consider the following two statements: S1: {02n|n≥1|} is a regular language S2: {0m1n0m+n|m≥1 and n≥1|} is a regular language Which of the following statements is correct? […]