Construct a turing machine which encrypts passwords

Assignment Help Theory of Computation
Reference no: EM132548009

Read the caselet below and answer questions which follow:

Assume there is need to encryptpasswords using the Zn-Algorithm. The Zn-Algorithm takes an alphanumeric password and coverts it into a binary digit. The alphanumeric password must start with any letter from the alphabet A= {a-z} and must have exactly one digit from the alphabet D = {0-9}. The password must end with at least two characters from A. A password is encrypted by converting any consonant (C) character into a binary digit 0, any vowel (V) into a binary digit 1 and the digit into 2 in binary. For example if the input tap has a password ret7ure, it must output or write 01010101 on the tap after encryption.

Required

i. Construct a Turing machine which encrypts passwords using the Zn algorithm. Describe how the machine works.
ii. Design a DFA which accepts valid encrypted passwords.
iii. Design a PDA which accepts valid encrypted passwords.
iv. Give the grammar in Chomsky Normal Form which generates valid encrypted passwords.
v. Does your grammar allow LL(1) parsing? Why? Or Why Not?

Reference no: EM132548009

Questions Cloud

How the units completed are : A company haa 2000 units in beginning work in process, 30,000 units started in current period and 3000 units in ending work in process. The units completed are
Compute of bl net profit for the month of february : Limited is engaged in the manufacture,Based on optimum product mix, compute of BL's net profit for the month of February 2012
How many tests must be performed each year to breakeven : If the hospital charges $30 per test, how many tests must be performed each year to breakeven on the services? how much should be charged for each test
Show how the costs would be apportioned to each department : Show how the costs would be apportioned to each department? A factory has two production departments: preparation and assembly
Construct a turing machine which encrypts passwords : Construct a Turing machine which encrypts passwords using the Zn algorithm. Describe how the machine works - Design a DFA which accepts valid encrypted password
What was the total direct manufacturing cost variance : What was the total direct manufacturing cost variance for the firm's May production performance? Compute Material quantity variance cost
What are the impacts of disease on the individual : What are the impacts of disease on the individual, family, economy, society, nation, and the world?
Calculate kemper should establish a selling price of : To increase its profitability by $40,000, Kemper should establish a selling price of (Calculate). Calculate the minimum selling price it should set
Rest of the solar system formed : The oldest rocks on the surface of the Earth today date to approximately 4.2 billion years ago. The Earth and the solar system

Reviews

Write a Review

Theory of Computation Questions & Answers

  Find finite-state automata

Find finite-state automata that recognize these sets of strings of 0s and 1s.

  List the closure properties

Given the following grammar in GNF, make an NPDA to accept the same language - Prove that the language is not context-free

  Construct a turing machine that computes the function

By finding the composite of the Turing machines you constructed in Exercises 18 and 22, construct a Turing machine that computes the function ƒ (n) = 2n + 2.

  Explanation of turing machine

Devise a Turing machine with input given in unary notation such that the equipments produces the following output, 0 if x is divisible by 4,

  Perform acl test and prepare a report with conclusions

Perform the ACL test and prepare a report with your conclusions. Document your report with ACL printouts showing details of test results and the command log - Identify an operational concern related to the revenue procedures.

  Derive a contradiction

State your assumptions for a proof by contradiction - Derive a contradiction.

  Construct a tm that recognizes the non-cfl language

Construct a TM that recognizes the non-CFL language L = {wcw | w is in (0+1)*} and halts on all inputs. Please briefly explain the purpose of each state of your machine. So, for example the string 1110c1110 IS in L but the string 0010c0110 is NOT.

  What is the vertex of highest degree in a graph

Can the vertices of a simple graph G be colored using three colors so that no two adjacent vertices are the same color?

  Construct a dfa that recognizes languages

Construct a DFA that recognizes each of the following languages. Unless otherwise noted we are assuming that ω ∈ {0,1}*. (A drawing of a state diagram is sufficient.)

  Is the given grammar left or right recursive

Is the given grammar left or right recursive - describe these in detail because I am having a hard time trying to figure this all out.

  What is the GNFA that results from ripping state

CS 5700 Computability, Automata, and Formal Languages Assignment, University of Colorado Colorado Springs, USA. What is the GNFA that results from ripping state

  Design a dfa to recognize language l

Design a DFA to recognize L and write a program that implements your DFA - you should check the ASCII code of each character of the string and process on the DFA accordingly.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd