Test: DFA Processing Strings

# Test: DFA Processing Strings - Computer Science Engineering (CSE)

Test Description

## 9 Questions MCQ Test Theory of Computation - Test: DFA Processing Strings

Test: DFA Processing Strings for Computer Science Engineering (CSE) 2023 is part of Theory of Computation preparation. The Test: DFA Processing Strings questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: DFA Processing Strings MCQs are made for Computer Science Engineering (CSE) 2023 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: DFA Processing Strings below.
Solutions of Test: DFA Processing Strings questions in English are available as part of our Theory of Computation for Computer Science Engineering (CSE) & Test: DFA Processing Strings solutions in Hindi for Theory of Computation course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: DFA Processing Strings | 9 questions in 10 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study Theory of Computation for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
 1 Crore+ students have signed up on EduRev. Have you?
Test: DFA Processing Strings - Question 1

### The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________

Detailed Solution for Test: DFA Processing Strings - Question 1

For a string of n characters with no repetitive substrings, the number of states required to pass the string is n+1.

Test: DFA Processing Strings - Question 2

### Which of the following is the corresponding Language to the given DFA?

Detailed Solution for Test: DFA Processing Strings - Question 2

The Language can be anonymously checked and thus the answer can be predicted. The language needs to be accepted by the automata (acceptance state) in order to prove its regularity.

Test: DFA Processing Strings - Question 3

### Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be represented as:

Detailed Solution for Test: DFA Processing Strings - Question 3

Union operation creates the universal set by combining all the elements of first and second set while intersection operation creates a set of common elements of the first and the second state.

Test: DFA Processing Strings - Question 4

Let the given DFA consist of x states. Find x-y such that y is the number of states on minimization of DFA?

Detailed Solution for Test: DFA Processing Strings - Question 4

Use the equivalence theorem or Myphill Nerode theorem to minimize the DFA

Test: DFA Processing Strings - Question 5

For a machine to surpass all the letters of alphabet excluding vowels, how many number of states in DFA would be required?

Detailed Solution for Test: DFA Processing Strings - Question 5

Test: DFA Processing Strings - Question 6

6. For the DFA given below compute the following:
Union of all possible combinations at state 7,8 and 9.

Detailed Solution for Test: DFA Processing Strings - Question 6

The string a state receives is the combination of all input alphabets which lie across the path covered.

Test: DFA Processing Strings - Question 7

Given L= {Xϵ∑*= {a, b} |x has equal number of a, s and b’s}.
Which of the following property satisfy the regularity of the given language?

Detailed Solution for Test: DFA Processing Strings - Question 7

DFA can be made for infinite language with an infinite length. Thus, dependency over length is unfruitful.

Test: DFA Processing Strings - Question 8

Given:
L= {xϵ∑= {0,1} |x=0n1n for n>=1}; Can there be a DFA possible for the language?

Detailed Solution for Test: DFA Processing Strings - Question 8

It is not possible to have a count of equal number of 0 and 1 at any instant in DFA. Thus, It is not possible to build a DFA for the given Language.

Test: DFA Processing Strings - Question 9

Detailed Solution for Test: DFA Processing Strings - Question 9

For a string of n characters with no repetitive substrings, the number of states required to pass the string is n+1.

## Theory of Computation

18 videos|56 docs|44 tests
Information about Test: DFA Processing Strings Page
In this test you can find the Exam questions for Test: DFA Processing Strings solved & explained in the simplest way possible. Besides giving Questions and answers for Test: DFA Processing Strings, EduRev gives you an ample number of Online tests for practice

## Theory of Computation

18 videos|56 docs|44 tests