1 Crore+ students have signed up on EduRev. Have you? Download the App 
Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________
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
A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation
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?
The minimum number of states required to recognize an octal number divisible by 3 are/is:
If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________
The number of elements in the set for the Language L={xϵ(∑r) *length if x is at most 2} and ∑={0,1} is_________
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?
Given: ∑= {a, b}
L= {xϵ∑*x is a string combination}
∑4 represents which among the following?
18 videos56 docs44 tests

18 videos56 docs44 tests
