CS402 Current paper, Which one of the following languages is a non-regular language? Which of the following are called as Halt states in PDA? Identify the TRUE statement about following CFG: S -> SB|AB A -> CC B -> b C -> a Which of the following cannot be represented by a regular expression? Set of all palindromes over {a,b} is: The CFG S--> aSa | bSb | a | b | ^ represents language. The strings or words which do not belong to a language are called of that language. The locations into which we put the input letters on "Input Tape" are called. Identify the FALSE statement about following CFG: S -> SB|AB A -> CC B -> b C -> a In a CFG, the non-terminals are denoted by. Before the CFG corresponding to the given PDA is determined, the PDA is converted into the standard form which is called. Set of all palindromes over {a,b} is: Between the two consecutive joints on a path For a machine with N number of states, the total number of strings to be teste...