Home / Engineering / Theory of Computation / Question
M
Q.) Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y and z belonging to Σ such that all the strings of the form XY^ n Z for n=1,2,3, … are the words in L called
Related MCQs on Theory of Computation
Q. A DBMS uses a transaction ____ to keep track of all transactions that update the database
Q. A transmitter and an antenna are used to ____________ the modulated signal within radio spectrum
Q. Cache memory works on the principle of
Q. Features being classified is __________ of each other in Naïve Bayes Classifier
Q. In which scheduling certain amount of CPU time is allocated to each process ?
Q. A palette can be defined as a finite set of colors for managing the
Q. Which is a time-sensitive service?
Q. Which of the following is not a old detail storage medium?
Q. Which one of the following is the characteristic of a multimedia system?
Discusssion
Login to discuss.