Bissoy.com
Doctors Medicines MCQs Q&A

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

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 Correct Answer 7

Language that can be accepted by DFA is 1001001 1001011, 1001101, 1001111, 1101001, 1111001, 1011001.

Related Questions

Consider the following Deterministic Finite Automaton M. Let S denote the set of eight-bit strings whose second, third, sixth and seventh bits are 1. The number of strings in S that are accepted by M is
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?
In the given Venn diagram, different animals are represented by different areas. 'A' denotes 'dogs', 'B' denotes 'cats', 'C' denotes 'fish', 'D' denotes 'mongooses, 'E' denotes 'rats', and 'F' denotes 'rabbits'. Which area represents the group of only dogs, fishes,  and mongooses?
If ‘<’ denotes ‘-’, ‘+’ denotes ‘+’, ‘-’ denotes ‘=’ ‘=’ denotes ‘<’ and ‘x’ denotes ‘>’, then , '>' denotes '>' which of the following statement is true?
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?
Assume that a 12-bit Hamming codeword consisting of 8-bit data and 4 check bits is d8d7d6d5c8d4d3d2c4d1c2c1, where the data bits and the check bits are given in the following tables: Data bits d8 d7 d6 d5 d4 d3 d2 d1 1 1 0 x 0 1 0 1   c8 c4 c2 c1 Y 0 1 0 Which one of the following choices gives the correct values of x and y?
A message consisting of 2400 bits is to be passed over the Internet. The message is passed to the transport layer which appends a 150-bit header, followed by the network layer which uses a 120-bit header. Network layer packets are transmitted via two networks, each of which uses a 26-bit header. The destination network only accepts up to 900 bits long. The number of bits, including headers delivered to the destination network, is
Two n bit binary strings, S1 and S2 are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of bit positions where the two strings differ) is equal to d is
How many states are there in a minimum state deterministic finite automaton accepting the language L = {w | ∈ (0,1)*, number of 0's is divisible by 2, and number of 1's is divisible by 5, respectively}?
Consider the following problems. L(?) denotes the language generated by a grammar ?. L(?) denotes the language accepted by a machine ?. (I) For an unrestricted grammar ? and a string ?, whether ? ∈ (?) (II) Given a Turing machine M, whether L(M) is regular (III) Given two grammars ?1 and ?2, whether (?1) = (?2) (IV) Given an NFA N, whether there is a deterministic PDA P such that N and P accept the same language. Which one of the following statements is correct?