332:437 Lecture 14 Turing Machines and State Machine Sequences

Slides:



Advertisements
Similar presentations
Finite-state Recognizers
Advertisements

Lecture 24 MAS 714 Hartmut Klauck
State-machine structure (Mealy)
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
Cook’s Theorem The Foundation of NP-Completeness.
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
Zvi Kohavi and Niraj K. Jha 1 Introduction to Synchronous Sequential Circuits and Iterative Networks.
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Digital Logic Design Lecture 27.
ECE 331 – Digital System Design
P, NP, PS, and NPS By Muhannad Harrim. Class P P is the complexity class containing decision problems which can be solved by a Deterministic Turing machine.
Equivalence, DFA, NDFA Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 2 Updated and modified by.
ECE C03 Lecture 111 Lecture 11 Finite State Machine Optimization Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
ECE C03 Lecture 131 Lecture 13 Finite State Machine Optimization Prith Banerjee ECE C03 Advanced Digital Design Spring 1998.
Asynchronous Machines
1 Decidability continued. 2 Undecidable Problems Halting Problem: Does machine halt on input ? State-entry Problem: Does machine enter state halt on input.
Spring 2002EECS150 - Lec15-seq2 Page 1 EECS150 - Digital Design Lecture 15 - Sequential Circuits II (Finite State Machines revisited) March 14, 2002 John.
Turing Machines CS 105: Introduction to Computer Science.
Digital Logic Design Lecture 28. Announcements Homework 9 due on Thursday 12/11 Please fill out Course Evaluations online. Final exam will be on Thursday,
ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)
ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)
Advanced Topics in Algorithms and Data Structures Lecture 8.2 page 1 Some tools Our circuit C will consist of T ( n ) levels. For each time step of the.
Zvi Kohavi and Niraj K. Jha 1 Capabilities, Minimization, and Transformation of Sequential Machines.
Zvi Kohavi and Niraj K. Jha 1 Memory, Definiteness, and Information Losslessness of Finite Automata.
1 Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 1 Adaptation to this.
Important Components, Blocks and Methodologies. To remember 1.EXORS 2.Counters and Generalized Counters 3.State Machines (Moore, Mealy, Rabin-Scott) 4.Controllers.
Turing Machines Chapter 17. Languages and Machines SD D Context-Free Languages Regular Languages reg exps FSMs cfgs PDAs unrestricted grammars Turing.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Part 1 – Pages COMPUTABILITY THEORY.
Testing of Synchronous Sequential Circuits By Dr. Amin Danial Asham.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Complexity & Computability. Limitations of computer science  Major reasons useful calculations cannot be done:  execution time of program is too long.
Fundamentals of Informatics Lecture 3 Turing Machines Bas Luttik.
TM Design Macro Language D and SD MA/CSSE 474 Theory of Computation.
Strings Basic data type in computational biology A string is an ordered succession of characters or symbols from a finite set called an alphabet Sequence.
Fundamentals of Informatics Lecture 12 The Halting Problem Bas Luttik.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
High Performance Embedded Computing © 2007 Elsevier Lecture 4: Models of Computation Embedded Computing Systems Mikko Lipasti, adapted from M. Schulte.
Lecture 24UofH - COSC Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 24.
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 3 The Church-Turing Thesis Contents Turing Machines definitions, examples,
Chapter 12 Theory of Computation Introduction to CS 1 st Semester, 2014 Sanghyun Park.
Universal Turing Machine
Capabilities, Minimization, and Transformation of Sequential Machines
CSE202: Introduction to Formal Languages and Automata Theory
Hardware Verification
Adapted by Dr. Adel Ammar
Modeling Arithmetic, Computation, and Languages
Turing Machines Chapter 17.
Testing of Synchronous Sequential Circuits
COSC 3340: Introduction to Theory of Computation
Theory of Computation Lecture 22: Turing Machines III
Turing Machines 2nd 2017 Lecture 9.
332:437 Lecture 17 FSM Hardware Modification for Reliability
Chapter 9 TURING MACHINES.
Sequential Networks and Finite State Machines
COSC 3340: Introduction to Theory of Computation
Hierarchy of languages
CSE 370 – Winter Sequential Logic-2 - 1
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES
Regular Expression Manipulation FSM Model
Decidable Languages A language L is decidable if there is a Turing machine ML such that given any word w  0*, then: Input of ML: a  b  … w Output of.
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Implement FSM with fewest possible states • Least number of flip flops
332:437 Lecture 17 FSM Hardware Modification for Reliability
332:437 Lecture 17 FSM Hardware Modification for Reliability
CSE S. Tanimoto Turing Completeness
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Computability Catch up last lecture. Turing machines. Variations
CS M51A/EE M16 Winter’05 Section 1 Logic Design of Digital Systems Lecture 11 February 23 W’05 Yutao He 4532B Boelter Hall
Theory of Computation Lecture 23: Turing Machines III
Presentation transcript:

332:437 Lecture 14 Turing Machines and State Machine Sequences Iterative logic networks State machine properties Distinguishing and Homing sequences State machine design to minimize hardware Summary Material from Switching and Finite Automata Theory, by Zvi Kohavi, McGraw-Hill Book Company. 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Turing and State Machines Called non-writing machines Have no control on their external input Cannot “write” or change their inputs Turing Machine – after A. M. Turing A writing machine Finite State Machine capable of modifying its own input symbols Fundamental Theoretical Model of all digital computers 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Bushnell: Digital Systems Design Lecture 14 Turing Machine Tape divided into squares – each contains a symbol (blank squares store a 0) Head has 3 operations: Read symbol in square being scanned Write new symbol in scanned square Shift tape 1 square in either direction 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Turing Machine (cont’d.) 1 Tape Finite-State Control Unit Head 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Bushnell: Digital Systems Design Lecture 14 Cycle of Computation Start in state Si Read symbol under head Write new symbol Shift left/right Enter new state Sj 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Turing Machine Example Present State A B C D Halt -- C, 1, R D, 0, L A, 0, R Halt 1 B, 0, R B, 1, R D, 1, L Next State, Write, Shift 1 ^A ^C 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Turing Machine Properties Anything a Universal Turing Machine can do, a digital computer can do Anything a Universal Turing Machine cannot do, a digital computer cannot do Emulation – A Universal Turing Machine can mimic or emulate the behavior of any other Turing Machine (and therefore, so can a computer) Halting Problem – A Universal Turing Machine (and therefore a computer) cannot predict when the computation of another Turing Machine will complete, and when it will not 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Iterative Logic Network Digital structure having cascade of identical cells Each may be a sequential circuit Every finite output sequence that can be produced sequentially by a sequential machine can be produced spatially (or simultaneously) by a combinational iterative network Cell Table – like State Machine transition table PS A B C D xi = 0 B/0 D/0 xi=1 A/0 C/0 C/1 NS, Zi 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Example Iterative Logic Array l inputs m outputs k state variables i time frames x21 x22 x2l xi1 xil x11 x12 x1l z11 z12 z1m z21 z22 z2m zi1 zi2 zim Y21 Y2k Yi1 Yik yi1 yik Cell 1 Cell 2 Cell 3 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Iterative Logic Arrays If same assignment used for iterative network as for sequential circuit Logic of cell & combinational logic of sequential circuit are identical # cells in iterative network must equal length of input patterns Iterative network is a time-unraveled history of the inputs to the state machine 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Formal Definition of Finite State Machine State Transition Function: S (t + 1) = d {S (t), x (t) } Output Function: z (t) = l {S (t), x (t) } Synchronous Sequential Machine – quintuple: M (I, O, S, d, l) d: I X S S l: I X S O S O I, O, S: Sets of inputs, outputs, & states 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Synchronous Sequential Machines View machine’s computation as transformation of input sequence into output sequence If input sequence X takes machine from state Si to State Sj, then Sj is the X-successor of Si If no input sequence exists to take machine M out of state D, then D is called a terminal state if: Corresponding vertex in state transition diagram is a sink vertex Corresponding vertex – no arcs coming from other vertices terminate at this one (source) –- Not accessible from any other state 11/5/2019 Bushnell: Digital Systems Design Lecture 14

State Machine Properties Example Give an n-state machine an arbitrarily long sequence of 1’s. Sequence is longer than n, so machine must arrive at some state it was already in before Period of machine – time between repetition of states Cannot be > n, could be smaller Conclusions: Finite State Machines cannot recognize infinite, aperiodic sequences of inputs Arbitrary Precision Serial Multiplication – not solvable by fixed FSM (fixed # of states) 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Distinguishing Sequences Finite input sequence that, when applied to FSM M, causes different output sequences Depending on whether Si or Sj was the starting state Called the Distinguishing Sequence of state pair (Si, Sj) If the sequence is of length K, then (Si, Sj) states are K-distinguishable States not K-distinguishable are K-equivalent If, for all K, states are K-equivalent, then the states are simply equivalent 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Bushnell: Digital Systems Design Lecture 14 Homing Sequences Input sequence is a Homing Sequence if final state of the machine can be uniquely determined from machine’s response to the sequence Regardless of the initial state 11/5/2019 Bushnell: Digital Systems Design Lecture 14

State Assignments to Minimize Hardware Done to minimize next state decoder hardware Rule 1: States having same NEXT STATES for a given input condition should have logically adjacent map cells Logical Adjacency 100 101 110 111 000 1/- 11/5/2019 Bushnell: Digital Systems Design Lecture 14

State Assignments to Minimize Hardware Rule 2: States that are NEXT STATES of a single state should have assignments that can be grouped into logically adjacent MAP cells Corollary: Make the assignments correspond to the branching (input) variable(s) – Reduced Input Dependency 100 101 110 111 000 11/ 10/ 01/ 00/ Should be the same 11/5/2019 Bushnell: Digital Systems Design Lecture 14

Bushnell: Digital Systems Design Lecture 14 Summary Turing Machines Iterative logic networks State machine properties Distinguishing and Homing sequences State machine design to minimize hardware 11/5/2019 Bushnell: Digital Systems Design Lecture 14