Question
a.
fan switch outputs {on, off}
b.
electricity meter reading
c.
colour of the traffic light at the moment
d.
none of the mentioned
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which of the following not an example Bounded Information?
Similar Questions
Discover Related MCQs
Q. A Language for which no DFA exist is a________
View solution
Q. A DFA cannot be represented in the following format
View solution
Q. When are 2 finite states equivalent?
View solution
Q. Can a DFA recognize a palindrome number?
View solution
Q. Which of the following is not an example of finite state machine system?
View solution
Q. The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________
View solution
Q. Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be represented as:
View solution
Q. For a machine to surpass all the letters of alphabet excluding vowels, how many number of states in DFA would be required?
View solution
Q. Given L= {Xϵ∑*= {a, b} |x has equal number of a, s and b’s}.
Which of the following property satisfy the regularity of the given language?
View solution
Q. Given:
L= {xϵ∑= {0,1} |x=0n1n for n>=1}; Can there be a DFA possible for the language?
View solution
Q. How many languages are over the alphabet R?
View solution
Q. According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}
Statement 1: q ϵ Q’;
Statement 2: FϵQ
View solution
Q. δˆ tells us the best:
View solution
Q. Which of the following option is correct?
A= {{abc, aaba}. {ε, a, bb}}
View solution
Q. For a DFA accepting binary numbers whose decimal equivalent is divisible by 4, what are all the possible remainders?
View solution
Q. Given:
L1= {xϵ ∑*|x contains even no’s of 0’s}
L2= {xϵ ∑*|x contains odd no’s of 1’s}
Nunber of final states in Language L1 U L2?
View solution
Q. The maximum number of transition which can be performed over a state in a DFA?
∑= {a, b, c}
View solution
Q. The maximum sum of in degree and out degree over a state in a DFA can be determined as:
∑= {a, b, c, d}
View solution
Q. The sum of minimum and maximum number of final states for a DFA n states is equal to:
View solution
Q. There are ________ tuples in finite state machine.
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!