Tape. Tape head. Control Unit. Executes a finite set of instructions
|
|
- Sara Mosley
- 6 years ago
- Views:
Transcription
1 Section 13.1 Turing Machines A Turing machine (TM) is a simple computer that has an infinite amount of storage in the form of cells on an infinite tape. There is a control unit that contains a finite set of state transition instructions. a Control Unit Tape Tape head Executes a finite set of instructions An instruction reads the symbol in the current tape cell, writes a symbol to the same cell, and then moves the tape head one cell left or right or remains at the same cell, after which the machine enters a new state. Assumptions: The symbol Λ denotes a blank cell. The tape head is initially at the left end of a nonempty input string (unless specified otherwise) There is a designated start state. There is one halt state. The moves are denoted by L, S, R for move left, stay, and move right. Instructions are represented in graphical form or as 5-tuples, as shown in the example to the right. This instruction executes if the current state of the TM is i and the current input symbol is a. The TM writes b into that cell, moves right one cell and enters state j. i a b, R (i, a, b, R, j) j 1
2 Acceptance An input string on the tape is accepted by the TM if the machine enters the halt state. The language of a TM is the set of all strings accepted by the machine. Example/Quiz. Given the following simple TM. (0, a, a, R, halt). What is the language of the TM? Answer: If an input string begins with the letter a, then the TM executes the instruction and halts. So the string is accepted. Therefore, the language of the TM is the set of all strings that begin with the letter a. Example. Construct a TM to accept the language {ab n n N}. If so, move right to scan b s until Λ is found. (0, a, a, R, 1) (1, Λ, Λ, S, halt) (1, b, b, R, 1). Quiz. Construct a TM to accept the language {ab n a n N}. If so, move right to scan b s until a is found. Then make sure there is Λ to the right. (0, a, a, R, 1) (1, a, a, R, 2) (1, b, b, R, 1) (2, Λ, Λ, S, halt). 2
3 Quiz. Construct a TM to accept the language of the regular expression a(a + b)*. If so, move right to scan any a s or b s until Λ is found. (0, a, a, R, 1) (1, a, a, R, 1) (1, b, b, R, 1) (1, Λ, Λ, S, halt). Example/Quiz. Find a TM to accept {a n b n n N}. If so, write X and scan right looking for a b to replace by Y. (0, Λ, Λ, S, halt) accept Λ (0, a, X, R, 1) mark a with X (0, Y, Y, R, 3) no more a s Scan right looking for b to pair with a: (1, a, a, R, 1) (1, Y, Y, R, 1) (1, b, Y, L, 2) mark b with Y Scan back left looking for X: (2, a, a, L, 2) (2, Y, Y, L, 2) (2, X, X, R, 0) Scan right looking for Λ and halt: (3, Y, Y, R, 3) (3, Λ, Λ, S, halt) TMs are very powerful. For example, the preceding example can be generalized to a TM that accepts the non-context free language {a n b n c n n N}. (See Example 13.2 in the Text.) So a TM can handle two stacks. In fact, a TM can handle any number of stacks. 3
4 Turing Machines with Output Specify the form of the output on the tape when the machine halts. Example/Quiz. Find a TM to add 4 to a natural number represented in binary. Start with the tape head at the right end of the input string and halt with the tape head at the left end of the output string. Solution. Let the start state be 0. Move two cells left: Add 1: (0, 0, 0, L, 1) (0, 1, 1, L, 1) (1, 0, 0, L, 2) (1, 1, 1, L, 2) (1, Λ, 0, L, 2) (2, 0, 1, L, 3) Move left (2, 1, 0, L, 2) Carry (2, Λ, 1, S, halt) Done Quiz. How would you construct a TM to add 5 to a binary number? Find left end of the string: (3, 0, 0, L, 3) (3, 1, 1, L, 3) (3, Λ, Λ, R, halt) Done One Solution: Add 1, move back to right end, and then use the preceding solution. For this purpose, let the start state be 4. Add 1: (4, 0, 1, R, 5) Move right (4, 1, 0, L, 4) Carry (4, Λ, 1, R, 5) Move right Find right end of the string: (5, 0, 0, R, 5) (5, 1, 1, R, 5) (5, Λ, Λ, L, 0) Go add 4 4
5 Example/Quiz. Find a TM to move any string over {a, b} to the left one cell position. Assume the tape head ends at the left end of any nonempty output string. Solution. Let the start state be 0. Find a or b to move: (0, a, Λ, L, 1) Go write a (0, b, Λ, L, 2) Go write b (0, Λ, Λ, L, 4) Done A trace for input aba (tape head is red): Λ a b a Λ (0, a, Λ, L, 1) Λ Λ b a Λ (1, Λ, a, R, 3) a Λ b a Λ (3, Λ, Λ, R, 0) a Λ b a Λ (0, b, Λ, L, 2) a Λ Λ a Λ (2, Λ, b, R, 3) a b Λ a Λ (3, Λ, Λ, R, 0) a b Λ a Λ (0, a, Λ, L, 1) a b Λ Λ Λ (1, Λ, a, R, 3) a b a Λ Λ (3, Λ, Λ, R, 0) a b a Λ Λ (0, Λ, Λ, L, 4) a b a Λ Λ (4, Λ, Λ, L, 5) a b a Λ Λ (5, a, a, L, 5) a b a Λ Λ (5, b, b, L, 5) a b a Λ Λ (5, a, a, L, 5) Λ a b a Λ Λ (5, Λ, Λ, R, halt) Λ a b a Λ Λ Output. Write a or b: (1, Λ, a, R, 3) Write a (2, Λ, b, R, 3) Write b (3, Λ, Λ, R, 0) Skip Λ Move to left end of output: (4, Λ, Λ, L, 5) (5, a, a, L, 5) (5, b, b, L, 5) (5, Λ, Λ, R, halt). Quiz. (Exercise 2). Find a TM to search for the symbol # on an otherwise empty tape, where the tape head starts at a random cell. A Solution: Use a new symbol, say x, to mark cells that have been searched as the machine alternately looks left and right. A Sample Trace: # Λ Λ Λ Λ # Λ x Λ Λ # x x Λ Λ # x x Λ Λ # x x x Λ # x x x Λ # x x x Λ. 5
6 Alternative Definitions of Turing Machine One-way Infinite Tape Multihead Multitape Quiz. Why are they all equal in power to the original definition of a Turing machine? An n-head or n-tape instruction contains n-tuples for the cell contents and move operations. Example. A typical instruction for a 2-head or a 2-tape TM is (0, (a, b), (c, d), (L, R), 1). Example/Quiz. Implement some sample PDA instructions as TM instructions for a 2-tape TM. Assume one tape holds the input string and the other tape holds the stack. Assume the input is scanned left to right and the the stack grows from right to left. PDA Instruction: 1. (i, a, X, nop, j) 2. (i, a, X, pop, j) 3. (i, a, X, push(y), j) 4. (i, Λ, X, pop, j). TM Instruction: 1. (i, (a, X), (a, X), (R, S), j) 2. (i, (a, X), (a, Λ), (R, R), j) 3. (i, (a, X), (a, X), (S, L), k) and (k, (a, Λ), (a, Y), (R, S), j) 4. For each letter a: (i, (a, X), (a, Λ), (S, R), j). a input stack X 6
7 Nondeterministic Turing Machines Example. Generate an arbitrary string over {a, b} of length n. Solution: Assume the input is any string over {a, b} of length n. The tape head is at the right end of the output string. (0, a, a, R, 0) (0, a, b, R, 0) (0, b, a, R, 0) (0, b, b, R, 0) (0, Λ, Λ, L, halt). Nondeterministic TMs have the same power as deterministic TMs The idea: Any nondeterministic TM can be simulated by a deterministic TM that simulates all 1-step computations, then all 2-step computations, and so on. The process stops if some computation enters the halt state. 7
Feb 22,2013. CS402- Theory of Automata Solved MCQS From Final term Papers. FINALTERM EXAMINATION Fall 2012 CS402- Theory of Automata
CS402- Theory of Automata Solved MCQS From Final term Papers Feb 22,2013 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 Question No: 1 ( Marks: 1 ) - Please choose one If Σ = {aa, bb}, then
More informationFor an alphabet, we can make do with just { s, 0, 1 }, in which for typographic simplicity, s stands for the blank space.
Problem 1 (A&B 1.1): =================== We get to specify a few things here that are left unstated to begin with. I assume that numbers refers to nonnegative integers. I assume that the input is guaranteed
More informationLecture 3: Nondeterministic Computation
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 3: Nondeterministic Computation David Mix Barrington and Alexis Maciel July 19, 2000
More informationInformatique Fondamentale IMA S8
Informatique Fondamentale IMA S8 Cours 1 - Intro + schedule + finite state machines Laure Gonnord http://laure.gonnord.org/pro/teaching/ Laure.Gonnord@polytech-lille.fr Université Lille 1 - Polytech Lille
More informationArtificial Intelligence
Artificial Intelligence Lab 2 Marco Piastra Lab 2-1 Turing Machine (A. Turing, 1937 An abstract model of effective computation A tape, made up of individual cells Each cell contains a symbol, from a finite
More informationThe word digital implies information in computers is represented by variables that take a limited number of discrete values.
Class Overview Cover hardware operation of digital computers. First, consider the various digital components used in the organization and design. Second, go through the necessary steps to design a basic
More informationThe Turing Test and Its Discontents
The Turing Test and Its Discontents Administrivia Class Website: http://l3d.cs.colorado.edu/~ctg/classes/issmeth08/issmeth0 8.html Midterm paper (due March 18; 35 percent of grade) Final paper (due May
More informationMusic and Mathematics: On Symmetry
Music and Mathematics: On Symmetry Monday, February 11th, 2019 Introduction What role does symmetry play in aesthetics? Is symmetrical art more beautiful than asymmetrical art? Is music that contains symmetries
More informationLogic Design ( Part 3) Sequential Logic- Finite State Machines (Chapter 3)
Logic esign ( Part ) Sequential Logic- Finite State Machines (Chapter ) Based on slides McGraw-Hill Additional material 00/00/006 Lewis/Martin Additional material 008 Roth Additional material 00 Taylor
More informationFinal Exam review: chapter 4 and 5. Supplement 3 and 4
Final Exam review: chapter 4 and 5. Supplement 3 and 4 1. A new type of synchronous flip-flop has the following characteristic table. Find the corresponding excitation table with don t cares used as much
More informationTesting Transition Systems with Input and Output Testers
Testing Transition Systems with Input and Output Testers Alexandre Petrenko 1, Nina Yevtushenko 2, and Jia Le Huo 3 1 CRIM, Centre de recherche informatique de Montréal 550 Sherbrooke West, Suite 100,
More informationLecture 11: Synchronous Sequential Logic
Lecture 11: Synchronous Sequential Logic Syed M. Mahmud, Ph.D ECE Department Wayne State University Aby K George, ECE Department, Wayne State University Contents Characteristic equations Analysis of clocked
More informationSequential Digital Design. Laboratory Manual. Experiment #3. Flip Flop Storage Elements
The Islamic University of Gaza Engineering Faculty Department of Computer Engineering Spring 2018 ECOM 2022 Khaleel I. Shaheen Sequential Digital Design Laboratory Manual Experiment #3 Flip Flop Storage
More informationI Don t Want to Think About it Now: Decision Theory With Costly Computation
I Don t Want to Think About it Now: Decision Theory With Costly Computation Joseph Y. Halpern Cornell University halpern@cs.cornell.edu Rafael Pass Cornell University rafael@cs.cornell.edu Abstract Computation
More informationHow to Predict the Output of a Hardware Random Number Generator
How to Predict the Output of a Hardware Random Number Generator Markus Dichtl Siemens AG, Corporate Technology Markus.Dichtl@siemens.com Abstract. A hardware random number generator was described at CHES
More informationFSM Test Translation Through Context
FSM Test Translation Through Context Khaled El-Fakih 1, Alexandre Petrenko 2, and Nina Yevtushenko 3 1 American University of Sharjah, UAE 2 Centre de recherche informatique de Montreal (CRIM), Montreal,
More informationMC9211 Computer Organization
MC9211 Computer Organization Unit 2 : Combinational and Sequential Circuits Lesson2 : Sequential Circuits (KSB) (MCA) (2009-12/ODD) (2009-10/1 A&B) Coverage Lesson2 Outlines the formal procedures for the
More informationAn Efficient Implementation of Interactive Video-on-Demand
An Efficient Implementation of Interactive Video-on-Demand Steven Carter and Darrell Long University of California, Santa Cruz Jehan-François Pâris University of Houston Why Video-on-Demand? Increased
More informationCombinational vs Sequential
Combinational vs Sequential inputs X Combinational Circuits outputs Z A combinational circuit: At any time, outputs depends only on inputs Changing inputs changes outputs No regard for previous inputs
More informationChapter. Synchronous Sequential Circuits
Chapter 5 Synchronous Sequential Circuits Logic Circuits- Review Logic Circuits 2 Combinational Circuits Consists of logic gates whose outputs are determined from the current combination of inputs. Performs
More informationLogic and Computer Design Fundamentals. Chapter 7. Registers and Counters
Logic and Computer Design Fundamentals Chapter 7 Registers and Counters Registers Register a collection of binary storage elements In theory, a register is sequential logic which can be defined by a state
More informationDigital Signal Processing Lecture One Introduction to Digital Signal Processing Third Stage Prepared by: Marwah Kareem
Lecture One Introduction to Digital Signal Processing Third Stage Prepared by: Marwah Kareem Digital Signal Processing Digital signal processing (DSP) technology and its advancements have dramatically
More informationMIDTERM EXAMINATION CS504- Software Engineering - I (Session - 6) Question No: 1 ( Marks: 1 ) - Please choose one By following modern system engineering practices simulation of reactive systems is no longer
More informationQuiz #4 Thursday, April 25, 2002, 5:30-6:45 PM
Last (family) name: First (given) name: Student I.D. #: Circle section: Hu Saluja Department of Electrical and Computer Engineering University of Wisconsin - Madison ECE/CS 352 Digital System Fundamentals
More informationData Representation. signals can vary continuously across an infinite range of values e.g., frequencies on an old-fashioned radio with a dial
Data Representation 1 Analog vs. Digital there are two ways data can be stored electronically 1. analog signals represent data in a way that is analogous to real life signals can vary continuously across
More informationLogic Design II (17.342) Spring Lecture Outline
Logic Design II (17.342) Spring 2012 Lecture Outline Class # 05 February 23, 2012 Dohn Bowden 1 Today s Lecture Analysis of Clocked Sequential Circuits Chapter 13 2 Course Admin 3 Administrative Admin
More informationUniversity of Pennsylvania Department of Electrical and Systems Engineering. Digital Design Laboratory. Lab8 Calculator
University of Pennsylvania Department of Electrical and Systems Engineering Digital Design Laboratory Purpose Lab Calculator The purpose of this lab is: 1. To get familiar with the use of shift registers
More informationChapter 5 Synchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic Chih-Tsun Huang ( 黃稚存 ) http://nthucad.cs.nthu.edu.tw/~cthuang/ Department of Computer Science National Tsing Hua University Outline Introduction Storage Elements:
More information16 Dec Testing and Programming PCBA s. 1 JTAG Technologies
6 Dec 24 Testing and Programming PCBA s JTAG Technologies The importance of Testing Don t ship bad products to your customers, find problems before they do. DOA s (Death On Arrival) lead to huge costs
More informationBar Codes to the Rescue!
Fighting Computer Illiteracy or How Can We Teach Machines to Read Spring 2013 ITS102.23 - C 1 Bar Codes to the Rescue! If it is hard to teach computers how to read ordinary alphabets, create a writing
More informationACT-R ACT-R. Core Components of the Architecture. Core Commitments of the Theory. Chunks. Modules
ACT-R & A 1000 Flowers ACT-R Adaptive Control of Thought Rational Theory of cognition today Cognitive architecture Programming Environment 2 Core Commitments of the Theory Modularity (and what the modules
More informationDepartment of CSIT. Class: B.SC Semester: II Year: 2013 Paper Title: Introduction to logics of Computer Max Marks: 30
Department of CSIT Class: B.SC Semester: II Year: 2013 Paper Title: Introduction to logics of Computer Max Marks: 30 Section A: (All 10 questions compulsory) 10X1=10 Very Short Answer Questions: Write
More informationCPU Bach: An Automatic Chorale Harmonization System
CPU Bach: An Automatic Chorale Harmonization System Matt Hanlon mhanlon@fas Tim Ledlie ledlie@fas January 15, 2002 Abstract We present an automated system for the harmonization of fourpart chorales in
More informationLaboratory Exercise 7
Laboratory Exercise 7 Finite State Machines This is an exercise in using finite state machines. Part I We wish to implement a finite state machine (FSM) that recognizes two specific sequences of applied
More information18 Nov 2015 Testing and Programming PCBA s. 1 JTAG Technologies
8 Nov 25 Testing and Programming PCBA s JTAG Technologies The importance of Testing Don t ship bad products to your customers, find problems before they do. DOA s (Death On Arrival) lead to huge costs
More informationCSC258: Computer Organization. Combinational Logic
CSC258: Computer Organization Combinational Logic 1 Anonymous: Quizzes and Fairness... A lot of students in earlier sections share the quiz question with students who have the tutorial later in the evening...
More informationCSC 373: Algorithm Design and Analysis Lecture 17
CSC 373: Algorithm Design and Analysis Lecture 17 Allan Borodin March 4, 2013 Some materials are from Keven Wayne s slides and MIT Open Courseware spring 2011 course at http://tinyurl.com/bjde5o5. 1 /
More informationCHAPTER1: Digital Logic Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits 1 Sequential Circuits Introduction Composed of a combinational circuit to which the memory elements are connected to form a feedback
More informationUNIT III. Combinational Circuit- Block Diagram. Sequential Circuit- Block Diagram
UNIT III INTRODUCTION In combinational logic circuits, the outputs at any instant of time depend only on the input signals present at that time. For a change in input, the output occurs immediately. Combinational
More informationD Latch (Transparent Latch)
D Latch (Transparent Latch) -One way to eliminate the undesirable condition of the indeterminate state in the SR latch is to ensure that inputs S and R are never equal to 1 at the same time. This is done
More informationObjectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath
Objectives Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath In the previous chapters we have studied how to develop a specification from a given application, and
More informationTraining Note TR-06RD. Schedules. Schedule types
Schedules General operation of the DT80 data loggers centres on scheduling. Schedules determine when various processes are to occur, and can be triggered by the real time clock, by digital or counter events,
More informationcs281: Introduction to Computer Systems Lab07 - Sequential Circuits II: Ant Brain
cs281: Introduction to Computer Systems Lab07 - Sequential Circuits II: Ant Brain 1 Problem Statement Obtain the file ant.tar from the class webpage. After you untar this file in an empty directory, you
More informationEECS 270 Final Exam Spring 2012
EECS 270 Final Exam Spring 2012 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. Scores: Page # Points 2 /20 3 /12 4 /10 5 /15
More informationDigital Circuits ECS 371
igital Circuits ECS 371 r. Prapun Suksompong prapun@siit.tu.ac.th Lecture 17 Office Hours: BK 3601-7 Monday 9:00-10:30, 1:30-3:30 Tuesday 10:30-11:30 1 Announcement Reading Assignment: Chapter 7: 7-1,
More informationLAB 3 Verilog for Combinational Circuits
Goals To Do LAB 3 Verilog for Combinational Circuits Learn how to implement combinational circuits using Verilog. Design and implement a simple circuit that controls the 7-segment display to show a 4-bit
More informationCourse Administration
EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN Lecture 5: Sequential Logic - 2 Analysis of Clocked Sequential Systems 4/2/2 Avinash Kodi, kodi@ohio.edu Course Administration 2 Hw 2 due on today
More informationPerry High School Bands
Perry High School Bands AP Music Theory Syllabus Full Year 2015-16 Brandon Kiesgen, Director of Bands kiesgen.brandon@cusd80.com 480-224-2960 www.perrybands.com Course Description: Advanced Placement Programs
More informationDigital Electronics II 2016 Imperial College London Page 1 of 8
Information for Candidates: The following notation is used in this paper: 1. Unless explicitly indicated otherwise, digital circuits are drawn with their inputs on the left and their outputs on the right.
More informationComp 410/510. Computer Graphics Spring Introduction to Graphics Systems
Comp 410/510 Computer Graphics Spring 2018 Introduction to Graphics Systems Computer Graphics Computer graphics deals with all aspects of 'creating images with a computer - Hardware (PC with graphics card)
More informationBit Swapping LFSR and its Application to Fault Detection and Diagnosis Using FPGA
Bit Swapping LFSR and its Application to Fault Detection and Diagnosis Using FPGA M.V.M.Lahari 1, M.Mani Kumari 2 1,2 Department of ECE, GVPCEOW,Visakhapatnam. Abstract The increasing growth of sub-micron
More informationChapter 5: Synchronous Sequential Logic
Chapter 5: Synchronous Sequential Logic NCNU_2016_DD_5_1 Digital systems may contain memory for storing information. Combinational circuits contains no memory elements the outputs depends only on the inputs
More informationIndividual Project Report
EN 3542: Digital Systems Design Individual Project Report Pseudo Random Number Generator using Linear Feedback shift registers Index No: Name: 110445D I.W.A.S.U. Premaratne 1. Problem: Random numbers are
More information1. What does the signal for a static-zero hazard look like?
Sample Problems 1. What does the signal for a static-zero hazard look like? The signal will always be logic zero except when the hazard occurs which will cause it to temporarly go to logic one (i.e. glitch
More informationECE 301 Digital Electronics
ECE 301 Digital Electronics Derivation of Flip-Flop Input Equations and State Assignment (Lecture #24) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,
More informationPart II. Chapter2: Synchronous Sequential Logic
課程名稱 : 數位系統設計導論 P-/77 Part II Chapter2: Synchronous Sequential Logic 教師 : 郭峻因教授 INSTRUCTOR: Prof. Jiun-In Guo E-mail: jiguo@cs.ccu.edu.tw 課程名稱 : 數位系統設計導論 P-2/77 Special thanks to Prof. CHING-LING SU for
More informationCopyright 2011 by Enoch Hwang, Ph.D. and Global Specialties. All rights reserved. Printed in Taiwan.
Copyright 2011 by Enoch Hwang, Ph.D. and Global Specialties All rights reserved. Printed in Taiwan. No part of this publication may be reproduced, stored in a retrieval system or transmitted, in any form
More informationProblems with D-Latch
Problems with -Latch If changes while is true, the new value of will appear at the output. The latch is transparent. If the stored value can change state more than once during a single clock pulse, the
More informationEET2411 DIGITAL ELECTRONICS
5-8 Clocked D Flip-FlopFlop One data input. The output changes to the value of the input at either the positive going or negative going clock trigger. May be implemented with a J-K FF by tying the J input
More informationFinal Examination (Open Katz, Calculators OK, 3 hours)
Your Name: UNIVERSITY OF CALIFORNIA AT BERKELEY BERKELEY DAVIS IRVINE LOS ANGELES RIVERSIDE SAN DIEGO SAN FRANCISCO Department of Electrical Engineering and Computer Sciences SANTA BARBARA SANTA CRUZ CS
More informationSri Vidya College of Engineering And Technology. Virudhunagar Department of Electrical and Electronics Engineering
Sri Vidya College of Engineering And Technology Virudhunagar 626 005 Department of Electrical and Electronics Engineering Year/ Semester/ Class : II/ III/ EEE Academic Year: 2017-2018 Subject Code/ Name:
More informationIntroduction to Probability Exercises
Introduction to Probability Exercises Look back to exercise 1 on page 368. In that one, you found that the probability of rolling a 6 on a twelve sided die was 1 12 (or, about 8%). Let s make sure that
More informationUNIT IV CMOS TESTING. EC2354_Unit IV 1
UNIT IV CMOS TESTING EC2354_Unit IV 1 Outline Testing Logic Verification Silicon Debug Manufacturing Test Fault Models Observability and Controllability Design for Test Scan BIST Boundary Scan EC2354_Unit
More informationDIGITAL SYSTEM FUNDAMENTALS (ECE421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE422) LATCHES and FLIP-FLOPS
COURSE / CODE DIGITAL SYSTEM FUNDAMENTALS (ECE421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE422) LATCHES and FLIP-FLOPS In the same way that logic gates are the building blocks of combinatorial circuits, latches
More informationImport and quantification of a micro titer plate image
BioNumerics Tutorial: Import and quantification of a micro titer plate image 1 Aims BioNumerics can import character type data from TIFF images. This happens by quantification of the color intensity and/or
More informationТМ-04 Multichannel long range UHF alarm transmitter Operating manual. Sectron Ltd.
Office: 52 G.M.Dimitrov blvd. 1125 Sofia tel: 02 91982 fax: 02 732576 TM-04 revision V1.0. ТМ-04 Multichannel long range UHF alarm transmitter Operating manual Sectron Ltd. www.sectron.com TM-04 description
More informationILDA Image Data Transfer Format
ILDA Technical Committee Technical Committee International Laser Display Association www.laserist.org Introduction... 4 ILDA Coordinates... 7 ILDA Color Tables... 9 Color Table Notes... 11 Revision 005.1,
More informationCascadable 4-Bit Comparator
EE 415 Project Report for Cascadable 4-Bit Comparator By William Dixon Mailbox 509 June 1, 2010 INTRODUCTION... 3 THE CASCADABLE 4-BIT COMPARATOR... 4 CONCEPT OF OPERATION... 4 LIMITATIONS... 5 POSSIBILITIES
More informationChapter 5 Sequential Systems. Introduction
hapter 5 Seuential Systems Latches and Flip-flops Synchronous ounter synchronous ounter 7822 igital Logic esign @epartment of omputer Engineering U. Introduction Up to now everything has been combinational
More informationMODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER CS 203: Switching Theory and Logic Design. Time: 3 Hrs Marks: 100
MODEL QUESTIONS WITH ANSWERS THIRD SEMESTER B.TECH DEGREE EXAMINATION DECEMBER 2016 CS 203: Switching Theory and Logic Design Time: 3 Hrs Marks: 100 PART A ( Answer All Questions Each carries 3 Marks )
More informationFinite State Machine Design
Finite State Machine Design One machine can do the work of fifty ordinary men; no machine can do the work of one extraordinary man. -E. Hubbard Nothing dignifies labor so much as the saving of it. -J.
More information1.1 The Language of Mathematics Expressions versus Sentences
. The Language of Mathematics Expressions versus Sentences a hypothetical situation the importance of language Study Strategies for Students of Mathematics characteristics of the language of mathematics
More informationMATHEMATICAL APPROACH FOR RECOVERING ENCRYPTION KEY OF STREAM CIPHER SYSTEM
MATHEMATICAL APPROACH FOR RECOVERING ENCRYPTION KEY OF STREAM CIPHER SYSTEM Abdul Kareem Murhij Radhi College of Information Engineering, University of Nahrian,Baghdad- Iraq. Abstract Stream cipher system
More informationJin-Fu Li Advanced Reliable Systems (ARES) Laboratory. National Central University
Chapter 3 Basics of VLSI Testing (2) Jin-Fu Li Advanced Reliable Systems (ARES) Laboratory Department of Electrical Engineering National Central University Jhongli, Taiwan Outline Testing Process Fault
More informationISO/IEC INTERNATIONAL STANDARD
INTERNATIONAL STANDARD ISO/IEC 80 First edition 996-08-0 Information technology -,65 mm wide magnetic tape cartridge for information interchange - Helical scan recording - Data-D format Technologies de
More informationChapter 8 Sequential Circuits
Philadelphia University Faculty of Information Technology Department of Computer Science Computer Logic Design By 1 Chapter 8 Sequential Circuits 1 Classification of Combinational Logic 3 Sequential circuits
More informationDigital Logic. ECE 206, Fall 2001: Lab 1. Learning Objectives. The Logic Simulator
Learning Objectives ECE 206, : Lab 1 Digital Logic This lab will give you practice in building and analyzing digital logic circuits. You will use a logic simulator to implement circuits and see how they
More informationFPGA Implementation of Sequential Logic
ECE 428 Programmable ASIC Design FPGA Implementation of Sequential Logic Haibo Wang ECE Department Southern Illinois University Carbondale, IL 62901 8-1 Sequential Circuit Model Combinational Circuit:
More informationAvailable online at ScienceDirect. Procedia Computer Science 46 (2015 ) Aida S Tharakan a *, Binu K Mathew b
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 46 (2015 ) 1409 1416 International Conference on Information and Communication Technologies (ICICT 2014) Design and Implementation
More informationFig 1. Flow Chart for the Encoder
MATLAB Simulation of the DVB-S Channel Coding and Decoding Tejas S. Chavan, V. S. Jadhav MAEER S Maharashtra Institute of Technology, Kothrud, Pune, India Department of Electronics & Telecommunication,Pune
More informationReport on 4-bit Counter design Report- 1, 2. Report on D- Flipflop. Course project for ECE533
Report on 4-bit Counter design Report- 1, 2. Report on D- Flipflop Course project for ECE533 I. Objective: REPORT-I The objective of this project is to design a 4-bit counter and implement it into a chip
More informationMath and Music. Cameron Franc
Overview Sound and music 1 Sound and music 2 3 4 Sound Sound and music Sound travels via waves of increased air pressure Volume (or amplitude) corresponds to the pressure level Frequency is the number
More informationCalifornia State University, Bakersfield Computer & Electrical Engineering & Computer Science ECE 3220: Digital Design with VHDL Laboratory 7
California State University, Bakersfield Computer & Electrical Engineering & Computer Science ECE 322: Digital Design with VHDL Laboratory 7 Rational: The purpose of this lab is to become familiar in using
More informationRevelation Principle; Quasilinear Utility
Revelation Principle; Quasilinear Utility Lecture 14 Revelation Principle; Quasilinear Utility Lecture 14, Slide 1 Lecture Overview 1 Recap 2 Revelation Principle 3 Impossibility 4 Quasilinear Utility
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 6 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
More informationAgenda. EE 260: Introduction to Digital Design Counters and Registers. Asynchronous (Ripple) Counters. Asynchronous (Ripple) Counters
EE26: igital esign, Spring 28 4/8/8 EE 26: Introduction to igital esign ounters and Registers Yao Zheng epartment of Electrical Engineering University of Hawaiʻi at Mānoa Agenda ounters Introduction: ounters
More informationSection 6.8 Synthesis of Sequential Logic Page 1 of 8
Section 6.8 Synthesis of Sequential Logic Page of 8 6.8 Synthesis of Sequential Logic Steps:. Given a description (usually in words), develop the state diagram. 2. Convert the state diagram to a next-state
More informationDepartment of Computer Science and Engineering Question Bank- Even Semester:
Department of Computer Science and Engineering Question Bank- Even Semester: 2014-2015 CS6201& DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common to IT & CSE, Regulation 2013) UNIT-I 1. Convert the following
More informationPart 1: Introduction to Computer Graphics
Part 1: Introduction to Computer Graphics 1. Define computer graphics? The branch of science and technology concerned with methods and techniques for converting data to or from visual presentation using
More informationLaboratory Exercise 7
Laboratory Exercise 7 Finite State Machines This is an exercise in using finite state machines. Part I We wish to implement a finite state machine (FSM) that recognizes two specific sequences of applied
More informationExperiment 8 Introduction to Latches and Flip-Flops and registers
Experiment 8 Introduction to Latches and Flip-Flops and registers Introduction: The logic circuits that have been used until now were combinational logic circuits since the output of the device depends
More informationTo design a sequential logic circuit using D-Flip-flop. To implement the designed circuit.
6.1 Objectives To design a sequential logic circuit using D-Flip-flop. To implement the designed circuit. 6.2 Sequential Logic So far we have implemented digital circuits whose outputs depend only on its
More informationAvailable online at ScienceDirect. Procedia Technology 24 (2016 )
Available online at www.sciencedirect.com ScienceDirect Procedia Technology 24 (2016 ) 1155 1162 International Conference on Emerging Trends in Engineering, Science and Technology (ICETEST 2015) FPGA Implementation
More informationName: Date: Suggested Reading Chapter 7, Digital Systems, Principals and Applications; Tocci
Richland College Engineering Technology Rev. 0 B. Donham Rev. 1 (7/2003) J. Horne Rev. 2 (1/2008) J. Bradbury Digital Fundamentals CETT 1425 Lab 7 Asynchronous Ripple Counters Name: Date: Objectives: To
More informationLab 5 FPGA Design Flow Based on Aldec Active-HDL. Fast Reflex Game.
Lab 5 FPGA Design Flow Based on Aldec Active-HDL. Fast Reflex Game. Task 0 (tested during lab demonstration) Get familiar with the Tutorial on FPGA Design Flow based on Aldec Active-HDL. Be ready to perform
More informationTask 4_B. Decoder for DCF-77 Radio Clock Receiver
Embedded Processor Lab (EIT-EMS-546-L-4) Task 4_B FB Elektrotechnik und Informationstechnik Prof. Dr.-Ing. Norbert Wehn Dozent: Uwe Wasenmüller Raum 12-213, wa@eit.uni-kl.de Task 4_B Decoder for DCF-77
More informationLab #5: Design Example: Keypad Scanner and Encoder - Part 1 (120 pts)
Nate Pihlstrom, npihlstr@uccs.edu Lab #5: Design Example: Keypad Scanner and Encoder - Part 1 (120 pts) Objective The objective of lab assignments 5 through 9 are to systematically design and implement
More informationIntroduction to JTAG / boundary scan-based testing for 3D integrated systems. (C) GOEPEL Electronics -
Introduction to JTAG / boundary scan-based testing for 3D integrated systems (C) 2011 - GOEPEL Electronics - www.goepelusa.com Who is GOEPEL? World Headquarters: GÖPEL electronic GmbH Göschwitzer Straße
More information2D ELEMENTARY CELLULAR AUTOMATA WITH FOUR NEIGHBORS
2D ELEMENTARY CELLULAR AUTOMATA WITH FOUR NEIGHBORS JOSÉ ANTÓNIO FREITAS Escola Secundária Caldas de Vizela, Rua Joaquim Costa Chicória 1, Caldas de Vizela, 4815-513 Vizela, Portugal RICARDO SEVERINO CIMA,
More informationIlmenau, 9 Dec 2016 Testing and programming PCBA s. 1 JTAG Technologies
Ilmenau, 9 Dec 206 Testing and programming PCBA s JTAG Technologies The importance of Testing Don t ship bad products to your customers, find problems before they do. DOA s (Death On Arrival) lead to huge
More information