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

For each of the following languages, construct agrammarand indicate its Chomsky hierarchy type (s) (pick all integer type [0, 1,2 3]that apply)
2. Give the transition diagram for a DFA for each of the following languages over the alphabet {0, 1}: (a) {w : w does not contain the substring 001} (b) {w : every pair of consecutive O's in w occurs before any pair of consecutive l's } (c) {w : (no(w) + n1(w)) mod 3 = 2}
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)*)
Define a CFG that describes the language a*b° c² where z
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?]
QUESTION 3 For each of the following languages {0, 1, 2}, give a TM accepting them. over 1. L= (0 13i 2 |i2 0}
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
Give a DFA (both state transition diagram and table as well as description of each state) for each of the following languages
Given the following diagram, in which letters stand for arbitrary languages, determine which languages must be equal for the reduction to be valid A B D E J K CG H F L
1
1. Let L be a language defined over a unary alphabet L = {0* | k = 0 mod 2 or k = 0 mod 3} Design an NFA that accepts L. = {0}: