COE 202: Fundamentals of Computer Eng. (T061) Dr. Marwan Abu-Amara Equivalent States.

Slides:

Advertisements

Similar presentations

Nonlinear & Neural Networks LAB. PART State Reduction ( )

Advertisements

Rules of Matrix Arithmetic

L8 – Reduction of State Tables. Reduction of states  Given a state table reduce the number of states.  Eliminate redundant states  Ref: text Unit 15.

Lecture 21 State minimization via implication charts.

Some Slides from: U.C. Berkeley, U.C. Berkeley, Alan Mishchenko, Alan Mishchenko, Mike Miller, Mike Miller, Gaetano Borriello Gaetano Borriello Introduction.

VIII - Working with Sequential Logic © Copyright 2004, Gaetano Borriello and Randy H. Katz 1 Finite state machine optimization State minimization  fewer.

1.5 Elementary Matrices and a Method for Finding

ECE 331 – Digital System Design State Reduction and State Assignment (Lecture #22) The slides included herein were taken from the materials accompanying.

Sequential Circuit Design. 2 State Optimization Equivalent States:  Two states are equivalent if, for each member of the set of inputs,  they give exactly.

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.

1 State Reduction: Row Matching Example 1, Section 14.3 is reworked, setting up enough states to remember the first three bits of every possible input.

Chapter 5 Section 5 Permutations and Combinations.

COE 308: Computer Architecture (T041) Dr. Marwan Abu-Amara Integer & Floating-Point Arithmetic (Appendix A, Computer Architecture: A Quantitative Approach,

Behavioral Equivalence Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 7 Modifications and updates.

CSCI 3301 Transparency No. 9-1 Chapter #9: Finite State Machine Optimization Contemporary Logic Design.

Table of Contents Matrices - Multiplication Assume that matrix A is of order m  n and matrix B is of order p  q. To determine whether or not A can be.

1.2 Represent Functions as Rules and Tables

5  Systems of Linear Equations: ✦ An Introduction ✦ Unique Solutions ✦ Underdetermined and Overdetermined Systems  Matrices  Multiplication of Matrices.

Lecture 10: Inner Products Norms and angles Projection Sections 2.10.(1-4), Sections 2.2.3, 2.3.

Unit 7: Probability Lesson 2 Tree Diagrams, fundamental counting principle, sample space lists and tables, permutation, combination, factorials.

1 1.1 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra SYSTEMS OF LINEAR EQUATIONS.

Graphing Linear Equations

7.5 Inverse Function 3/13/2013. x2x+ 3 x What do you notice about the 2 tables (The original function and it’s inverse)? The.

Numerical Computation Lecture 7: Finding Inverses: Gauss-Jordan United International College.

Functions Teacher Twins©2014.

CS1Q Computer Systems Lecture 5 Simon Gay. Lecture 5CS1Q Computer Systems - Simon Gay2 Where we are Global computing: the Internet Networks and distributed.

Analysis of Variance (Two Factors). Two Factor Analysis of Variance Main effect The effect of a single factor when any other factor is ignored. Example.

Chapter 4.8: Determine if the Relation is a Function.

Introduction to Functions 3 January Definition Function – a set (of points, an equation, or a graph) where each domain (input) has exactly one range.

Functions. Warm Up Solve each equation. 1.2x – 6 = x = X + 29 = x – 5 – 4x = 17 x = 14 x = - 7 x = -15 x = 11.

Decidable Questions About Regular languages 1)Membership problem: “Given a specification of known type and a string w, is w in the language specified?”

Units Of Output TFCTVCTCMCAFCAVC Marginal Cost Puzzle 20.

Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.

A relation is an operation, or series of operations, that maps one number onto another.

Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

Relations and Functions Intermediate Algebra II Section 2.1.

COE 308: Computer Architecture (T032) Dr. Marwan Abu-Amara Integer & Floating-Point Arithmetic (Appendix A, Computer Architecture: A Quantitative Approach,

SOLUTION EXAMPLE 1 Represent relations Consider the relation given by the ordered pair (–2, –3), (–1, 1), (1, 3), (2, –2), and (3, 1). a. Identify the.

1.3 Solutions of Linear Systems

Arab Open University Faculty of Computer Studies M132: Linear Algebra

Table of Contents Matrices - Definition and Notation A matrix is a rectangular array of numbers. Consider the following matrix: Matrix B has 3 rows and.

Acute angle: An angle with a measure less than 90º.

Copyright © Cengage Learning. All rights reserved. Graphs; Equations of Lines; Functions; Variation 3.

REVIEW Linear Combinations Given vectors and given scalars

SLIDES FOR CHAPTER 15 REDUCTION OF STATE TABLES STATE ASSIGNMENT

3.1 Introduction to Determinants

Sequential logic design principles

Click the mouse button or press the Space Bar to display the answers.

4.8 Functions and Relations

State Reduction and State Assignment

Euclidean Inner Product on Rn

Control Structure Senior Lecturer

3.2 Properties of Determinants

L10 – additional State Machine examples

1.6 Represent Functions as Rules and Tables

Implement FSM with fewest possible states • Least number of flip flops

3.2 Properties of Determinants

COE 202: Digital Logic Design Combinational Logic Part 3

Function Rules and Tables.

Logical Truth To show a statement A is a logic truth (tautology) ...

Program to find equivalence classes

Linear Algebra Lecture 6.

Objective- To use an equation to graph the

Objective- To graph a relationship in a table.

X Y Relation (a set of ordered pairs) x y x y ( , ) x y Mapping

Relation (a set of ordered pairs)

P 72 (PDF 76) Figure 32 Information item name Rules in columns

Presentation transcript:

COE 202: Fundamentals of Computer Eng. (T061) Dr. Marwan Abu-Amara Equivalent States

COE 202 (T061) – Dr. Marwan Abu-Amara 2 Definition 2 states are equivalent if for each possible input:  Both states give exactly same output and go to same next state, or  Both states give exactly same output and go to same equivalent next states

COE 202 (T061) – Dr. Marwan Abu-Amara 3 Example PresentNext StateOutput Statex = 0x = 1x = 0x = 1 acb01 bda01 cad10 dbd10 States a & b have same output for the same input Next states for a & b:  c & d for x = 0  b & a for x = 1 If c & d are equivalent, then a & b are equivalent because same or equivalent next states  (a, b) imply (c, d) States c & d have same output for the same input Next states for c & d:  a & b for x = 0  d & d for x = 1 If a & b are equivalent, then c & d are equivalent because same or equivalent next states  (c, d) imply (a, b)

COE 202 (T061) – Dr. Marwan Abu-Amara 4 Example … PresentNext StateOutput Statex = 0x = 1x = 0x = 1 aca01 cac10 Since (a, b) imply (c, d) and (c, d) imply (a, b), then both pairs are equivalent  a equivalent to b  c equivalent to d

COE 202 (T061) – Dr. Marwan Abu-Amara 5 Implication Table Chart that consists of squares, one for every possible pair of states, that provide spaces for listing any possible implied states  Triangular table with (n – 1) rows & (n – 1) columns, where n = # states  Columns:states 1  (n – 1)  Rows:states 2  n  Place “x” if 2 states are NOT equivalent  Place “ ” if 2 states are equivalent  Place “condition” for 2 states to be equivalent  Go over all table entries until they are marked as either “x” or “ ”

COE 202 (T061) – Dr. Marwan Abu-Amara 6 Example PresentNext StateOutput Statex = 0x = 1x = 0x = 1 adb00 bea00 cgf01 dad10 ead10 fcb00 gae10 b c d e f g abcdef d, e x x x c, d x x x x c, e a, b x x x x x x d, e x x x x  (a = b) and (d = e = g)

COE 202 (T061) – Dr. Marwan Abu-Amara 7 Example … PresentNext StateOutput Statex = 0x = 1x = 0x = 1 ada00 cdf01 dad10 fca00