adplus-dvertising
frame-decoration

Question

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

a.

Union

b.

Concatenation

c.

Kleene*

d.

All of the mentioned

Answer: (d).All of the mentioned

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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?

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

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

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

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_________

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

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

∑4 represents which among the following?

Q. Moore Machine is an application of:

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

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

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:

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

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)

Q. The output alphabet can be represented as:

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

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

Q. Which of the given are correct?

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

Q. The ratio of number of input to the number of output in a mealy machine can be given as:

Q. Mealy and Moore machine can be categorized as: