Test: Automata

# Test: Automata - Computer Science Engineering (CSE)

Test Description

## 10 Questions MCQ Test Theory of Computation - Test: Automata

Test: Automata for Computer Science Engineering (CSE) 2023 is part of Theory of Computation preparation. The Test: Automata questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Automata MCQs are made for Computer Science Engineering (CSE) 2023 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Automata below.
Solutions of Test: Automata questions in English are available as part of our Theory of Computation for Computer Science Engineering (CSE) & Test: Automata 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: Automata | 10 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: Automata - Question 1

### Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________

Detailed Solution for Test: Automata - Question 1

A partially ordered relation refers to one which is Reflexive, Transitive and Antisymmetric.

Test: Automata - Question 2

### The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1

Detailed Solution for Test: Automata - Question 2

The Kleene star of A, denoted by A*, is the set of all strings obtained by concatenating zero or more strings from A.

Test: Automata - Question 3

### A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation

Detailed Solution for Test: Automata - Question 3

Union, Intersection, Concatenation, Kleene*, Reverse are all the closure properties of Regular Language.

Test: Automata - Question 4

Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its states; Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?

Detailed Solution for Test: Automata - Question 4

It is possible to represent a finite automaton graphically, with nodes for states, and arcs for transitions.

Test: Automata - Question 5

The minimum number of states required to recognize an octal number divisible by 3 are/is:

Detailed Solution for Test: Automata - Question 5

According to the question, minimum of 3 states are required to recognize an octal number divisible by 3.

Test: Automata - Question 6

Which of the following is a not a part of 5-tuple finite automata?

Detailed Solution for Test: Automata - Question 6

Explanation: A FA can be represented as FA= (Q, ∑, δ, q0, F) where Q=Finite Set of States, ∑=Finite Input Alphabet, δ=Transition Function, q0=Initial State, F=Final/Acceptance State).

Test: Automata - Question 7

If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________

Detailed Solution for Test: Automata - Question 7

A Compiler is used to give a finite solution to an infinite phenomenon. Example of an infinite phenomenon is Language C, etc.

Test: Automata - Question 8

The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and ∑={0,1} is_________

Detailed Solution for Test: Automata - Question 8

∑r= {1,0} and a Kleene* operation would lead to the following set=COUNT{ε,0,1,00,11,01,10} =7.

Test: Automata - Question 9

Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?

Detailed Solution for Test: Automata - Question 9

We need minimum n+1 states to build NFA that accepts all substrings of a binary string. For example, following NFA accepts all substrings of “010″ and it has 4 states.

Test: Automata - Question 10

Given: ∑= {a, b}
L= {xϵ∑*|x is a string combination}
∑4 represents which among the following?

Detailed Solution for Test: Automata - Question 10

Explanation: ∑* represents any combination of the given set while ∑x represents the set of combinations with length x where x ϵ I.

## Theory of Computation

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

## Theory of Computation

18 videos|56 docs|44 tests