Let a digit be one of the ten decimal digits 0,1,2,3,4,5,6,7,8,9. Draw the state diagram for a DFA that recognizes the language of digit strings that represent base-10 numbers that are one more than a multiple of three. For example, your DFA should accept 07658 since 07654 = 7654 = 3(2551) + 1. On the other hand, 7655 would not be accepted since 7655= 3(2551) + 2. Hint: Use three states, representing numbers of the form 3n, 3n+1 and 3n+2. Think about what happens when we add a digit to the end of a given number. For example, when we add a 0, 3n+1, for example, will go to 10(3n+1) = 3(10n+3)+1, in other words, back to a number of the form 3n+1. The same thing will happen when we add a 3, 6 or 9 to the end. Continuing in this way you can fill in all the transitions between the three states. Upload a pic of your state diagram.

Let a digit be one of the ten decimal digits 0,1,2,3,4,5,6,7,8,9. Draw the state diagram for a DFA that recognizes the language of digit strings that represent base-10 numbers that are one more than a multiple of three. For example, your DFA should accept 07658 since 07654 = 7654 = 3(2551) + 1. On the other hand, 7655 would not be accepted since 7655= 3(2551) + 2. Hint: Use three states, representing numbers of the form 3n, 3n+1 and 3n+2. Think about what happens when we add a digit to the end of a given number. For example, when we add a 0, 3n+1, for example, will go to 10(3n+1) = 3(10n+3)+1, in other words, back to a number of the form 3n+1. The same thing will happen when we add a 3, 6 or 9 to the end. Continuing in this way you can fill in all the transitions between the three states. Upload a pic of your state diagram.

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

Design a PDA which will accept the language consisting of strings over the alphabet ∑={a,b} where number of a's and b's are not equal to each other.You can use maximum 5 states in your PDA. Hint: Use an extra symbol!
Q2: Design a PDA for accepting a language {0^1m0n | m, n>=1} give the ID form as we explain in the lecture. Apply the string "00011000" on this PDA using ID transitions.
Build a DFA that accepts the set of string over {1,2,3} the sum of digits is divisible by five. For example 11111, 221, 311, 1211, etc.
Consider the code C={00010, 01100,01011,11010,01010}. What is the minimum distance of C? For what k is the code C k-error detecting? Write the set of error patterns that C can detect?
Given the ASN.1 definition Light ENUMERATED { dark (0)em parkingLight (1), halfLight (2), fullLight (3) } Encode the following in TLV format (in Hex): daylight Light ::= halflight
Draw a DFA over the alphabet {a,b,c}that only accepts strings with no c’s and an even number of a’s, or an odd number of c’s and an odd number of b’s. For example, it should accept aa, aba, abbabaa, cbacabcb, cbcca, and abc but not aca, bacc, or aaa.
Draw an NFA that accepts words from the alphabet {0,1} where the last character is not repeated anywhere else in the word. (example: words 0, 1, 00001, 111110, ε are in the language of this NFA, while words 010, 111, 0010, 101 are not). Please explain in detail and give me the full(not simplified) NFA.
An airline association assigns three-letter codes to represent airport locations. For example, the airport code for Clark, Pampanga, is CPP. Notice that repetition is allowed in forming this code. How many airport codes are possible?
One method that can be used to compress text data is run length encoding (RLE). When RLE is used the compressed data can be represented as a set of character/frequency pairs. When the same character appears in consecutive locations in the original text it is replaced in the compressed text by a single instance of the character followed by a number indicating the number of consecutive instances of that character. Single instances of a character are represented by the character followed by the number 1. Figure 9 and Figure 10 show examples of how text would be compressed using this method. Figure 9 Original text: AAARRRRGGGHH Compressed text: A 3 R 4 G 3 H 2 Figure 10 Original text: CUTLASSES Compressed text: C 1 U 1 T 1 L 1 A 1 S 2 E 1 S 1 What you need to do Task 1 Write a Python program that will perform the compression process described above. The program should display a suitable prompt asking the user to input the text to compress and then output the compressed text. Task 2 Test…
For any binary string x, let #0(x) and #1(x) denote the number of 0’sand the number of 1’s in x, respectively. Design a DFA to accept the following language:L = {x | x ∈ {0, 1}∗, the summation 3 · #0(x) + 2 · #1(x) is divisible by 5}
Draw an FSM for the L(r) where r = (da*b + cb*a)c + cd over the alphabet {a, b, c, d} Indicate the Start State and the Final State(s). Provide two examples of strings that are accepted by the FSM and write the transition sequences to validate. Provide two examples of strings that are not accepted by the FSM and write the transition sequences to validate.
Write a program in C that can convert a bit stream of a message into a frame by using Hamming coding. The bit stream is the input parameter of the program. For example, given an input parameter as 1001000, the correct output of the frame is 00110010000. Input bit stream will have 1 to 64 bits. Some self-testing examples are:Input 1001000; output 00110010000Input 1101001100110101; output 011110110011001110101Input 1010101; output 11110100101Input 11111111; output 111011101111 Write a program in C that can convert a bit stream of a message into a frame by using CRC. The bit stream is the first input parameter of the program, which will have 8 to 128 bits. The generator function is the second input parameter of the program, which will have 4 to 16 bits. For example, if the generator function is x^4 + x + 1, the second input will be 10011. The output should be the transmitted bit stream with its CRC checksum bits; see example in Figure 3-9 in the textbook. Some self-testing examples…