Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following is not a member of the set of a deterministic finite state machine?

Which of the following is not a member of the set of a deterministic finite state machine? Correct Answer initial state

A deterministic finite state machine or acceptor deterministic finite state machine is a quintuple (Σ, G, s1, δ, F), where: Σ is the input alphabet (a finite, non-empty set of symbols), G is a finite, non-empty set of states, s1 is an initial state, an element of S, δ is the state-transition functioδ: G × Σ → G.

Related Questions

A signal is said to be 1. Deterministic if there is no uncertainty over the signal at any instant of time. 2. Deterministic if it is expressible through a mathematical equation. 3. Random or non-deterministic if there is uncertainty over the signal at the instant of time. 4. Random or non-deterministic if it is not expressible through a mathematical equation. Which of the above statements are correct?
Suppose we want to design a synchronous circuit that processes a string of 0’s and 1’s. Given a string, it produces another string by replacing the first 1 in any subsequence of consecutive 1’s by a 0. Consider the following example. Input sequence: 00100011000011100 Output sequence: 00000001000001100 A Mealy Machine is a state machine where both the next state and the output are functions of the present state and the current input. The above mentioned circuit can be designed as a two-state Mealy machine. The states in the Mealy machine can be represented using Boolean values 0 and 1. We denote the current state, the next state, the next incoming bit, and the output bit of the Mealy machine by the variables s, t, b and y respectively. Assume the initial state of the Mealy machine is 0. What are the Boolean expressions corresponding to t and y in terms of s and b ?
The average age of a family having three members is 40 years. The smallest member of the family is 18 years old. The difference between the age of the oldest family member and the age of the second oldest family member is 6 more than the difference between the age of the second oldest member and age of youngest member of the family. Quantity I: 25 years hence, what will be the average of the age of smallest member and that of oldest member of the family? Quantity II: What is the age of the oldest member of the family?   
Which of the following statements is/are FALSE? 1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. 2. Turing recognizable languages are closed under union and complementation. 3. Turing decidable languages are closed under intersection and complementation. 4. Turing recognizable languages are closed under union and intersection.
Without needing extra __________ we can simulate non deterministic turing machine using deterministic turing machine.
A deterministic finite automaton (DFA) D with alphabet ∑ = {a,b} is given below. Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?
Consider the language L = {an |n ≥ 0} ∪ {anbn| n ≥ 0} and the following statements. I. L is deterministic context-free. II. L is context-free but not deterministic context-free. III. L is not LL(k) for any k. Which of the above statements is/are TRUE?
Consider the following statements regarding milling machine: 1. In the vertical milling machine, it Is possible to machine dovetail recesses. 2. In universal milling machine, the worktable can be swivelled. 3. In rotary milling machine, motion imparted to work is rotary. 4. Planer milling machine is provided with several horizontal and vertical heads. Which of the above statements are correct?
In a press there are three types of printing machines A, B, and C. Machine A can print ten thousand pages in 8 hours, machine B can do the same task in 10 hours, and machine C can do the same task in 12 hours. All three machines start the task at 9∶00 a.m. Machine A breaks down at 11∶00 a.m. and machines B and C continue working. At 12∶00 noon machine B also breaks down and machine C alone has to complete the remaining task. What is the approximate time of completion of the task?
Consider the following deterministic finite state automaton M. S denotes the set of seven bit in which the 1st ,4th and last bits are 1. The number of strings that are accepted by M is