Let L1, L2 be two regular languages and L3 a language which is not regular. Which of the following statements is/are always TRUE?
Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet {0, 1}, and has the set of states {s, p, q, r}, with s being the start state and p being the only final state. Which one of the following regular expressions correctly describes the language accepted by A?
Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions: letter [A-Za-z]digit [0-9]id letter (letter | digit) Which one of the following Non-deterministic Finite-state Automata with -transitions accepts the set of valid identifiers? (A double-circle denotes a final state)
Which of the following statements is/are CORRECT?
Which one of the following regular expressions correctly represents the language of the finite automaton given below?
Which of the following statements is/are TRUE?
Which one of the following regular expressions represents the set of all binary strings with an odd number of 1's?
Consider the following statements. I. If L1 L2 is regular, then both L1 and L2 must be regular. II. The class of regular languages is closed under infinite union. Which of the above statements is/are TRUE?
Consider the language L = {an | n 0} anbn | n 0} and the following statements. I. L is deterministic context-free II. L is context-free but not deterministic context-free. III. L is not LL(k) for any k. Which of the above statements is/are TRUE?
Which of the following languages are undecidable?? Note that M indicates the encoding of the Turing machine M. L1 = {M | L(M) = Ø} L2 = {M, w, q | M on input w reaches state q in exactly 100 step} L3= {M | L(M)is not recursive} L4 = {M | L(M) contains at least 21 members}
Consider the following languages. L1 = {wxyx | w, x, y (0 + 1)+}L2 = {xy | x, y (a + b)*, |x| = |y|, xy } Which one of the following is TRUE??
Consider the following language. L = { x {a,b}* | number of a's in x divisible by 2 but not divisible by 3 } The minimum number of states in DFA that accepts L is _______.