A deterministic finite state automaton has initial state so, final state so, and transition function f 0 1 S0 81 82 Which of the following is required by any recognised string? 81 80 82 80 81 80 The length of the string must be a multiple of three. The string must end in a 0. O The string must end in a 1. O There must be at least three Os in the string.

A deterministic finite state automaton has initial state so, final state so, and transition function f 0 1 S0 81 82 Which of the following is required by any recognised string? 81 80 82 80 81 80 The length of the string must be a multiple of three. The string must end in a 0. O The string must end in a 1. O There must be at least three Os in the string.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

The word's length in a finite language with its FA of ten states O must be less than ten length of all words in this language is exactly ten may be greater than ten undetermined by the given information To test if an FA of 4 states over alphabets accepts any string or not, O O test only strings of length 4 test all strings with length less than 4 test one string of length greater than 4 check all possible strings of Σ What do you add in the following statement of pumping-lemma-I to make it a statement of pumping-lemma-II. Let L be any infinite regular language accepted by an FA with P states defined over an alphabet Σ then there exist three strings x, y, and z belonging to Σ*( where y is not the null string) such that all the strings of the form xyz for n=1,2,3, ... are the words in L. (length of x + length of y) is less or equal to N Ⓒ (length of x + length of y) is greater or equal to N (length of x + length of z) is less or equal to N length of all words is greater or equal to N
Computer Science Engineering:
Construct a DFA which accepts those strings over Σ={0,1} that satisfy all of the following conditions: • length at least 6 • second symbol is 0 • first symbol and third symbol are equal to each other
Q1\ Suppose you have the state diagram of DfA named M1 . Answer about the following questions about machine M1. *
a) Give an example of a string containing 11 that is accepted by the following automaton. b) Give an example of a string of length 8 that is rejected by the following automaton. c) Describe the language of this automaton in plain English. d) Describe the language of this automaton using Regular expression.
Answer in C language
= = 2×2 and 6 = (a) A composite number is a positive integer that has at least one divisor other than 1 and itself. For example, 2 1×2 is not a composite number but 4 2 × 3 are composite numbers. A logic circuit has four binary input variables, A, B, C and D. The output Z of the logic circuit is 1 if the unsigned integer represented by the binary number ABCD is a composite number. Using variables A and B for the select inputs S1 and S0 of a 4-to-1 multiplexer, implement the logic function Z(A, B, C, D) using this multiplexor and other logic gates.
Artificial Inteligence
Not pseudocode Suppose the economies of the world use a set of currencies C1, . . . , Cn; think of these as dollars, pounds, Bitcoin, etc. Your bank allows you to trade each currency Ci for any other currency Cj, and finds some way to charge you for this service. Suppose that for each ordered pair of currencies (Ci, Cj ), the bank charges a flat fee of fij > 0 dollars to exchange Ci for Cj (regardless of the quantity of currency being exchanged). Describe an algorithm which, given a starting currency Cs, a target currency Ct, and a list of fees fij for all i, j ∈ {1, . . . , n}, computes the cheapest way (that is, incurring the least in fees) to exchange all of our currency in Cs into currency Ct. Also, justify the its runtime. [We are expecting a description of the algorithm, as well as a brief justification of its runtime.]
QUESTION 1 Let M=((a, b, c, d, e}, {0,1}, a, fs, {b, d}) be the DFA and f, is given by: fs a b с d e 0 a с d (2 b 1 b a e d a Draw the state diagram of M. Which of the strings 0101, 1111 and 0001 are accepted by M? X
In-Class Assignment Consider an (8,4) binary linear block code with minimum distance of 4. • How many valid codewords are there? • What is the code rate? • What is the minimum weight of the code? • If the code is used for error detection only, how many errors can it detect? • If the code is used for error correction, how many errors can it correct?
= {a'ba' | i > 0}. Let E = {a, b}. Let L = Give a Turing machine (TM) that accepts the language L. Assume ; that, when the TM starts, the head is on a blank symbol, A, and the input string is immediately after that blank symbol on the tape. For example, if the input string were aaabaaa, then the inital tape configuration would be A a a aba a a