Theory of Computation - Regular Language Models

26. Which of the following regular expressions denotes a language comprising all possible strings over the alphabet {a, b }?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


27. An FSM (Finite State Machine) can be considered to be a TM (Turing Machine) of finite tape length

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


28. Palindromes can't be recognized by any FSM because

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


29. If ∑ = {a, b, c, d, e, f } then number of strings in ∑ of length 4 such that no symbol is used more than once in a string is

  • Option : B
  • Explanation : Here string length is 4 so we can create string of length 4 by 6 values. Suppose at first place we can arrange any value by 6 methods.so 6. then Remaining total numbers are 5 so we can arrange them by 5 methods at second place. then remaining total numbers are 4 so we can arrange them by 4 methods. now remaining total numbers are 3 and we can arrange them by 3 methods. so according to permutation technique. We multiply them i.e. 6*5*4*3=360. So, 'B'
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


30. A language L is accepted by a finite automaton if and only if it is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *