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

View solution

Q. 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

View solution

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

View solution

Q. 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?

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. For the following change of state in FA, which of the following codes is an incorrect option?

View solution

Q. Given: ∑= {a, b}
L= {xϵ∑*|x is a string combination}

∑4 represents which among the following?

View solution

Q. Moore Machine is an application of:

View solution

Q. In Moore machine, output is produced over the change of:

View solution

Q. For a give Moore Machine, Given Input=’101010’, thus the output would be of length:

View solution

Q. Statement 1: Null string is accepted in Moore Machine.
Statement 2: There are more than 5-Tuples in the definition of Moore Machine.

Choose the correct option:

View solution

Q. The total number of states and transitions required to form a moore machine that will produce residue mod 3.

View solution

Q. What is the output for the given language?
Language: A set of strings over ∑= {a, b} is taken as input and it prints 1 as an output “for every occurrence of a, b as its substring. (INPUT: abaaab)

View solution

Q. The output alphabet can be represented as:

View solution

Q. The O/P of Moore machine can be represented in the following format:

View solution

Q. In mealy machine, the O/P depends upon?

View solution

Q. Which of the given are correct?

View solution