Consider a language L defined over an alphabet Σ if two strings x and y defined over Σ are run over an FA accepting the language L,then x and y are said to belong to the same __ if they end in the same __.

Related Posts 👇

• If R is a regular language and L is some language, and L U R is a regular language, then L must be a regular language?

  (A) True
  (B) False
  (C) NA
  (D) NA

  ►Correct Option
  
  Correct Option is: A
  

• Closure of an FA, is same as __ of an FA with itself, except that the initial state of the required FA is a final state as well.

  (A) Union
  (B) Sum
  (C) Concatenation
  (D) Intersection

  ►Correct Option
  
  Correct Option is: C
  

• Considering FA1 and FA2 having 2 states each. Now FA1+FA2 can have maximum __ number of states.

  (A) 2
  (B) 3
  (C) more than 3
  (D) none of them

  ►Correct Option
  
  Correct Option is: D
  

• The CFG is said to be ambiguous if there exist at least one word of its language that can be generated by the __.

  (A) One
  (B) Two
  (C) More than one
  (D) At most one

  ►Correct Option
  
  Correct Option is: C
  

• The production of the form: Nonterminal-> ^ is said to be __ production.

  (A) NULL
  (B) UNIT
  (C) Chomsky form production
  (D) None of the given options

  ►Correct Option
  
  Correct Option is: A
  

• Which of the following states is not part of PDA?

  (A) START
  (B) ACCEPT
  (C) WRTITE
  (D) REJECT

  ►Correct Option
  
  Correct Option is: C
  

• The input string is placed, before it runs, in?

  (A) Stack
  (B) Memory
  (C) Tape
  (D) Ram

  ►Correct Option
  
  Correct Option is: C
  

• In polish notation, (o-o-o) is the abbreviation Of__?

  (A) Operand – Operator – Operand
  (B) Operand – Operand- Operator
  (C) Operator -Operand – Operand
  (D) Operand -Operand – Operand

  ►Correct Option
  
  Correct Option is: C