1 Crore+ students have signed up on EduRev. Have you? 
Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________
A partially ordered relation refers to one which is Reflexive, Transitive and Antisymmetric.
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
The Kleene star of A, denoted by A*, is the set of all strings obtained by concatenating zero or more strings from A.
A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation
Union, Intersection, Concatenation, Kleene*, Reverse are all the closure properties of Regular Language.
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?
It is possible to represent a finite automaton graphically, with nodes for states, and arcs for transitions.
The minimum number of states required to recognize an octal number divisible by 3 are/is:
According to the question, minimum of 3 states are required to recognize an octal number divisible by 3.
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).
If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________
A Compiler is used to give a finite solution to an infinite phenomenon. Example of an infinite phenomenon is Language C, etc.
The number of elements in the set for the Language L={xϵ(∑r) *length if x is at most 2} and ∑={0,1} is_________
∑r= {1,0} and a Kleene* operation would lead to the following set=COUNT{ε,0,1,00,11,01,10} =7.
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 nondeterministic finite automaton that accepts L?
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.
Given: ∑= {a, b}
L= {xϵ∑*x is a string combination}
∑4 represents which among the following?
Explanation: ∑* represents any combination of the given set while ∑x represents the set of combinations with length x where x ϵ I.
18 videos44 docs39 tests

Use Code STAYHOME200 and get INR 200 additional OFF

Use Coupon Code 
18 videos44 docs39 tests








