2) Give a DFA (both state transition diagram and table as well as description of each state) for each of the following languages a) A language over alphabet E = {0,1,2,3,4,5,6,7} in which reverse of each string (for instance, reverse of 1234 is 4321) interpreted as an octadecimal (base-8) number is a multiple of 3. (for example: 14, 47, 135, 512, 702, 4001, 41713, e.t.c) (Hint: Consider inductive contruction wnew = wold:a which means wverse = %3D erse, where a denotes any symbol from E and then try to figure out the states of DFA with respect to possible values of a and the length of wola-) a. Wold

2) Give a DFA (both state transition diagram and table as well as description of each state) for each of the following languages a) A language over alphabet E = {0,1,2,3,4,5,6,7} in which reverse of each string (for instance, reverse of 1234 is 4321) interpreted as an octadecimal (base-8) number is a multiple of 3. (for example: 14, 47, 135, 512, 702, 4001, 41713, e.t.c) (Hint: Consider inductive contruction wnew = wold:a which means wverse = %3D erse, where a denotes any symbol from E and then try to figure out the states of DFA with respect to possible values of a and the length of wola-) a. Wold

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

explain with diagram
For each part below, construct an FSA accepting the indicated language over {0, 1}.a. The language of all strings where no two consecutive characters are the same.b. The language of all strings that do not contain 1100.
2. Construct a pda P for the following language: L = { 1031' | i> 1} where L = L(P) (acceptance by final state).
Problem 5. Find dfa's that accept the following languages: a) Laa+bba'b* ) b) Laa* + aba'b* ) c) L( (abba) + (aba'+b) ) d) L(((aa) h)*)
Create a one-of-a-kind regex. For regular languages, your regular expression must include all three operators (union, concatenation, Kleene star). Using the Kleene's theorem part 1 building approach, create an NFA from your regular expression. Check to see whether each operator has successfully converted their structural components, which should be preserved in the NFA (with the exception of the elimination of null transitions between the concatenation of single symbol NFAs)
For each of the languages below, draw a transition diagram for a DFA which accepts thatlanguage.(a) Strings over Σ = {a, b, c} which begin with the character a and end with the character c.(b) Strings over Σ = {a, b} in which the characters a and b always alternate. For example, stringsababa, bab, and a are in this language.(c) Strings over Σ = {a, b} which end with either aa or bb.(d) Strings over Σ = {0, 1, 2}, such that the sum of all digits in the string is divisible by 4.For example, the string 02101 is in the language because 0 + 2 + 1 + 0 + 1 = 4, which is divisible by 4;but 1212 is not, because 1 + 2 + 1 + 2 = 6 is not divisible by 4.
1. Suppose the languages recognized by DFAS M and N are L1 and L2 respectively. How can we use DFAS M and N to construct a DFA that recognizes the language L1nL2? [Can you use De Morgan's Law?]
Suppose the languages recognized by DFAS M and N are L1 and L2 respectively. How can we use DFAS M and N to construct a DFA that recognizes the language L10L2? [Can you use De Morgan's Law?]
Use Cartesian Product construction to do the following:
Show that each of the following languages is regular. Note that to show the regularity of a language you can construct an NFAor a DFA that recognizes the language. To present an automaton, draw its transitiondiagram. Below, xy denotes the concatenation of strings x and y. b)xy : x and y are binary strings with a common substring of length 2
Write down the CFG that generates for the following language.
Give a DFA (both state transition diagram and table as well as description of each state) for each of the following languages