CS150 Sp 98 R. Newton & K. Pister 1

Similar documents
Present state Next state Q + M N

d e c b a d c b a d e c b a a c a d c c e b

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

OpenMx Matrices and Operators

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Tangram Fractions Overview: Students will analyze standard and nonstandard

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

1 Introduction to Modulo 7 Arithmetic

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

CS 103 BFS Alorithm. Mark Redekopp

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Designing A Uniformly Loaded Arch Or Cable

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

In which direction do compass needles always align? Why?

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?

24CKT POLARIZATION OPTIONS SHOWN BELOW ARE REPRESENTATIVE FOR 16 AND 20CKT

Closed Monochromatic Bishops Tours

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE!

VLSI Testing Assignment 2

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

Seven-Segment Display Driver

DFA Minimization. DFA minimization: the idea. Not in Sipser. Background: Questions: Assignments: Previously: Today: Then:

The University of Sydney MATH 2009

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Designing A Concrete Arch Bridge

Organization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs

Lecture 20: Minimum Spanning Trees (CLRS 23)

Walk Like a Mathematician Learning Task:

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

Testing Digital Systems. CPE/EE 428, CPE 528 Testing Combinational Logic (3) Testing Digital Systems: Detection. Testing Digital Systems: Detection

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

EE1000 Project 4 Digital Volt Meter

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CS September 2018

(4, 2)-choosability of planar graphs with forbidden structures

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

Functions and Graphs 1. (a) (b) (c) (f) (e) (d) 2. (a) (b) (c) (d)

Constructive Geometric Constraint Solving

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Outline. Binary Tree

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm

Planar convex hulls (I)

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

On Hamiltonian Tetrahedralizations Of Convex Polyhedra

Computer Graphics. Viewing & Projections

Weighted Graphs. Weighted graphs may be either directed or undirected.

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor

Multipoint Alternate Marking method for passive and hybrid performance monitoring

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

ECE Experiment #4 Seven Segment Display Interfacing and Timing

(Minimum) Spanning Trees

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

ROSEMOUNT 3051SAM SCALABLE PRESSURE TRANSMITTER COPLANAR FLANGE PROCESS CONNECTION

ROOM NAME A2.0 A1.10 3'-8" UNIT 2A PROVIDE PERFORATED AND SLEEVED PIPE FOR CONNECTION TO FUTURE RADON MITIGATION SYSTEM. UNIT 1A UNIT 1A 104

CENTER POINT MEDICAL CENTER

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

Minimum Spanning Trees

12. Traffic engineering

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Indices. Indices. Curriculum Ready ACMNA: 209, 210, 212,

GREEDY TECHNIQUE. Greedy method vs. Dynamic programming method:

3 a 15a 6 b 21a 5 c 30a 6 d 12a 9. e 125a 8 f 36a 12 g 90a 13 h 56a a 6a b 5 c 3a 4 d 6a 4. e 10a 4 f 8a 2 g 5a 4 h 12a 2

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Telecommunications BUILDING INTERCOM CALL BUTTON WITH 3/4"C AND PULL STRING TO ACCESSIBLE CEILING SPACE. MOUNT 48" AFF.

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

ECE Experiment #6 Kitchen Timer

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

CS 461, Lecture 17. Today s Outline. Example Run

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

24.1 Sex-Linked Inheritance. Chapter 24 Chromosomal Basis of Inheritance Sex-Linked Inheritance Sex-Linked Inheritance

CS553 Lecture Register Allocation I 3

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

XML and Databases. Outline. Recall: Top-Down Evaluation of Simple Paths. Recall: Top-Down Evaluation of Simple Paths. Sebastian Maneth NICTA and UNSW

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

CS 241 Analysis of Algorithms

Section 10.4 Connectivity (up to paths and isomorphism, not including)

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

Transcription:

Outin Cok Synronous Finit- Mins Lst tim: Introution to numr systms: sin/mnitu, ons ompmnt, twos ompmnt Rviw o ts, ip ops, ountrs Tis tur: Rviw Ts & Trnsition Dirms Impmnttion Usin D Fip-Fops Min Equivn Inompty Spii Mins ssinmnt & Coin Sms Dsin Exmp: ssin Cos to s Dsin Exmp: Impmnt Usin D ip-ops Dsin Exmp: Impmnt Usin T ip-ops Exmp: Consir t stunt ssoition o vnin min wi ss o t /up. T min wi pt niks, ims, n qurtrs, on t tim. T o rs in wi st to tru wn or mor s n put into t min n t min wi rturn t orrt n. CS Nwton/Pistr 8.. CS Nwton/Pistr 8..2 primry (σ(t)) sonry (q(t)) Dinition: My Min Nxt- Mmory sonry (q(t+)) primry (z(t)) squnti min or My Min n rtriz y t quintup: M = ( S, Q, Z,, ) wr S = init non-mpty st o input symos σ, σ2,..., σi Q = init non-mpty st o stts q, q2,..., qn Z = init non-mpty st o output symos z, z2,..., zm = nxt-stt untion, wi mps Q S i Q = t output untion, wi mps Q S i Z primry (σ(t)) sonry (q(t)) Dinition: Moor Min Nxt- Mmory sonry (q(t+)) primry (z(t)) squnti min is si to o t Moor typ (Moor Min ) i its output untion is untion ony o its stts (i.. : Q i Z) Evry My Min n onvrt to Moor Min n vi vrs. I t Mmory is ok, t mins r Cok, Synronous My n Moor mins rsptivy. CS Nwton/Pistr 8.. CS Nwton/Pistr 8.. Dsin Exmp: s, s n s Exmp: Consir t stunt ssoition o vnin min wi ss o t /up. T min wi pt niks, ims, n qurtrs, on t tim. T o rs in wi st to tru wn or mor s n put into t min n t min wi rturn t orrt n. S = {,, 2 } M = ( S, Q, Z,, ) Squnti Min Z = { D, R, R, R, R, R2 } Nxt- n Funtions / t ( symo ropp or rity): q\s 2 q q,d q,d q,r q q,d q,r q,r q q,r q,r q,r2 Nxt, q q q Q = { q, q, q } q Mns tt upon t insrtion o, wn /D t min is in stt q, it wi o to q stt q, t o wi not rs n no n ( ) wi rturn. CS Nwton/Pistr 8.. CS Nwton/Pistr 8..6 CS Sp 98 R. Nwton & K. Pistr

How out Moor Min? S = {,, 2 } Nxt- Mmory Q = { q, q, q, } Z = { D, R, R, R, R, R2 } / Trnsition T n Trnsition Dirm: Moor Min q\s 2 z q q q q2 D q q q q D q q q2 q D q q q q2 R q2 q q q2 R q2 q q q2 R q q q q2 R q q q q2 R2 Nxt q/d q/r q2/r q/d q/d q/2 q2/r q/ CS Nwton/Pistr 8..7 CS Nwton/Pistr 8..8 Convrsion to My Min q\s 2 q q,d q,d q2,r q q q,d q,r q,r q,r q2,r q,r2 q q,d q,d q2,r q2 q,d q,d q2,r q2 q,d q,d q2,r q q,d q,d q2,r q q,d q,d q2,r Nxt, Min Equivn Lt q n q two stts o mins M n M rsptivy. s q n q r si to quivnt i, strtin wit q n q, or ny squn o input symos ppi to t two mins, t output squns r inti. I q n i r not inti, ty r si to istinuis. Lt M n M two squnti mins. M n M r si to qivnt i or vry stt o M tr xists t st on quivnt stt in M, n vi vrs. Simiry, i M n M r not quivnt w sy ty r istinuis. Two stts q n q r quivnt i: () q n q prou t sm output vus (or My mins, ty must prou t sm or input onitions). (2) For input omintion, q n q must v t sm nxt stt, or quivnt nxt stts. CS Nwton/Pistr 8..9 CS Nwton/Pistr 8.. Minimiztion o Compty-Spii Mins Dsin Exmp: Minimiztion Two stts r si to k-quivnt i, wn xit y n input squn o k symos, yi inti output squns. T min n prtition y tis k-quivn rtion into k-quivn sss. For ny n-stt min, tr n t most (n-) sussiv, istint prtitions. For ny n-stt min, ts quivn sss ontin on n ony on uniqu stt. To minimiz ompty-spii min: () Fin t -quivn sss, 2-quivn sss, t. unti t k+ quivn sss r t sm s t K quivn sss, tn stop. (2) Comin t stts in t sm ss into sin stt. I t min s m quivn sss, t min s m stts. q \ s 2 -prtition q q,d q,d q2,r I q q,d q,r q,r II q q,r q2,r q,r2 III q q,d q,d q2,r I q2 q,d q,d q2,r I q2 q,d q,d q2,r I q q,d q,d q2,r I q q,d q,d q2,r I CS Nwton/Pistr 8.. CS Nwton/Pistr 8..2 CS Sp 98 R. Nwton & K. Pistr 2

Dsin Exmp: Minimiztion ssinmnt -prtition q \ s 2 2-prtition q q,d q,d q2,r q q,d q,d q2,r I q2 q,d q,d q2,r q2 q,d q,d q2,r q q,d q,d q2,r q q,d q,d q2,r II q q,d q,r q,r III q q,r q2,r q,r2 q\s 2 q q,d q,d q,r q q,d q,r q,r q q,r q,r q,r2 W must ssin os to symoi vus. Cos or input n output symos r usuy "ivn" so w must trmin os or t stt symos. Tis pross is stt ssinmnt or stt oin. I inry stor mnts r us w n: Øo2(N s )ø < N m < N s CS Nwton/Pistr 8.. CS Nwton/Pistr 8.. Dsin Exmp: ssinmnt Minimum-Lnt Co For tis xmp, 2 < N m <. I w oos N m = 2, n ssin os rnomy, tn w v t stt t: q\σ 2,D,D,R,D,R,R,R,R,R2??,????,????,?? unus stt Impmnttion Usin D Fip-Fops Cn us positiv--trir D op-op irty to impmnt stor mnt: S = {,, 2 } Nxt- D Q D Q D Q Q = {,,} Z = { D, R, R, R, R, R2 } CS Nwton/Pistr 8.. CS Nwton/Pistr 8..6 Dsin Exmp: ssinmnt On-Hot Co For tis xmp, 2 < N m <. I w oos N m =, n ssin os rnomy ut wr xty on it o t o is "" or vi stt, tn w v t stt t: q\s 2,D,D,R,D,R,R,R,R,R2???,?????,?????,?????,?????,?????,?????,?????,?????,?????,?????,?????,?????,?????,?????,?? unus stts Stps to FSM Dsin Construt stt/output t rom t wor sription (or stt rp). Minimiztion: Minimiz t numr o stts (usuy ps). ssinmnt: Coos st o stt vris n ssin os to nm stts. Sustitut t stt-vri omintions into t stt/output t to rt trnsition/output t tt sows t sir nxt-stt vri omintion or stt/input omintion. Coos ip-op typ (.. D, J-K, T) or t stt mmory. Construt n xittion t tt sows t xittion vus rquir to otin t sir nxt-stt vu or stt/input omintion. Driv xittion qutions rom xittion t. Driv output qutions rom trnsition/output t. Drw oi irm tt sows omintion nxt-stt n output untions s w s ip-ops. CS Nwton/Pistr 8..7 CS Nwton/Pistr 8..8 CS Sp 98 R. Nwton & K. Pistr

Minimiztion Usin n Impition T Bui omptiiity kin t in r sp, s sown, n row q2, q,... qn n oumn q, q2, qn- (no n or ion). q\s z Minimiztion Usin m Impition T: Summry o ppro Construt n impition t wi ontins squr or pir o stts. L row q2, q,... qn n oumn q, q2, qn- (no n or ion). Compr pir o rows in t stt t. I t ssoit wit stts i n j r irnt, put n in squr i-j to init tt i j (trivi non-quivn). I t n t nxt stts r t sm, put in squr i-j to init i j (trivi quivn). In otr squrs, put stt-pirs tt must quivnt i stts i-j r to quivnt (i t nxt stts o i n j r m n n or som input σ, tn m-n is n impi pir n os in squr i-j). Go trou t non- n non- squrs, on t tim. I squr i-j ontins n impi pir n squr m-n ontins n, tn i j so put n in i-j s w. I ny 's wr in t st stp, rpt it unti no mor 's r. For squr i-j wi not ontinin n, i j. CS Nwton/Pistr 8..9 CS Nwton/Pistr 8..2 Impition T Exmp: Pss Impition T Exmp: Pss n Pss 2 q\s z - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - CS Nwton/Pistr 8..2 CS Nwton/Pistr 8..22 Impition T Exmp: Fin T Stps to FSM Dsin q\s z Construt stt/output t rom t wor sription (or stt rp). Minimiztion: Minimiz t numr o stts (usuy ps it). ssinmnt: Coos st o stt vris n ssin os to nm stts. Sustitut t stt-vri omintions into t stt/output t to rt trnsition/output t (nxt-stt t) tt sows t sir nxt-stt vri omintion or stt/input omintion. Construt nxt-stt K-mps s n. Coos ip-op typ (.. D, J-K, T) or t stt mmory. Construt n xittion t tt sows t ip-op input xittion vus rquir to otin t sir nxt-stt vu or stt/input omintion. Driv ip-op xittion qutions rom xittion t. Driv output qutions rom trnsition/output t. Drw oi irm tt sows omintion nxt-stt n output untions s w s ip-ops. CS Nwton/Pistr 8..2 CS Nwton/Pistr 8..2 CS Sp 98 R. Nwton & K. Pistr

Guiins or ssinmnt T i o t oowin uristis is to try to t t 's totr (in t sm impint) on t ip-op input mps. Tis mto os not ppy to proms n vn wn it is ppi it os not urnt minimum soution. s wi v t sm nxt stt, or ivn input, sou ivn jnt ssinmnts ("n-out orint"). s wi r t nxt stts o t sm stt sou ivn jnt ssinmnts ("n-in orint"). Tir priority, to simpiy t output untion, stts wi v t sm output or ivn input sou ivn jnt ssinmnts (tis wi p put t 's totr in t output K- mps; "output orint"). / / / / / / / / {,}; {,}; {,} But How Do You tuy Do It? Writ own o t stts tt sou ivn jnt ssinmnts orin to t ritri ov ("ssinmnt onstrints", or " min onstrints.") Tn, usin Krnu-mp, try to stisy s mny o tm s possi (or us omputr prorm wi os it: Kiss, Nov, Mustn, Ji). Som uiins to p r: ssin t strtin stt to t "" squr on t mp (pikin irnt squr osn't p, sin squrs v t sm numr o jnis n it's sir to rst to ""). Fnout-orint uiins n jny onitions rquir mor tn on sou stisi irst. Wn uiins rquir tt or stts jnt, ts stts sou p witin roup o on t ssinmnt mp. I tr r ony w, t output uiin sou ppi st. I tr r ots o n ony w stts, tn iv mor wit to t tir uiin. CS Nwton/Pistr 8..2 CS Nwton/Pistr 8..26 ssinmnt: Dsin Exmp q \ s q q, q2, q q, q2, q2 q, q, q q, q2, q q, q6, q q, q2, q6 q, q6, Consir t stt t opposit: Guiin : {q,q2,q,q6} sin v q s nxt-stt wit input. Simiry {q,q,q,q}; {q,q}; {q,q6}. Guiin 2: {q,q2} sin nxtstts o q. Simiry {q2,q}; {q,q}; {q2,q} twi; {q,q6} twi. Guiin : wou not wort usin r. W ry v ot o onstrints n tir is ony on output, mosty. ssinmnt: Dsin Exmp Givn t jny onstrints: : {q,q2,q,q6}; {q,q,q,q}; {q,q}; {q,q6}. 2: {q,q2}; {q2,q}; {q,q}; {q2,q} twi; {q,q6} twi. Coos numr o ip-ops: 6 stts so n t st n no mor tn 6. Try wit -, B, C sy. Tsk is now to oos ssinmnt o -it (C) stt os to q-q6 so tt s mny o t ov onstrints s possi r stisi, in t orr stt rir. C q q6 q 2 6 q2 q q q 7 B C q q q2 2 6 q q q q6 7 B CS Nwton/Pistr 8..27 CS Nwton/Pistr 8..28 ssinmnt: Dsin Exmp ssinmnts iv y tri-nrror (qustion: wou w v n to stisy mor onstrints usin ip-ops inst o?). Top ssinmnt s to os: q =, q =, q2 =, q =, q =, q =, q6 = Now w n onstrut t nxt-stt mps or t ssinmnt. {q,q2,q,q6} s BC q q q q2 q 9 q q2 2 8 q q2 q6 7 q q q2 q6 2 6 {q,q} {q,q,q} {q,q6} Stps to FSM Dsin Construt stt/output t rom t wor sription (or stt rp). Minimiztion: Minimiz t numr o stts (usuy ps it). ssinmnt: Coos st o stt vris n ssin os to nm stts. Sustitut t stt-vri omintions into t stt/output t to rt trnsition/output t (nxt-stt t) tt sows t sir nxt-stt vri omintion or stt/input omintion. Construt nxt-stt K-mps s n. Coos ip-op typ (.. D, J-K, T) or t stt mmory. Construt n xittion t tt sows t ip-op input xittion vus rquir to otin t sir nxt-stt vu or stt/input omintion. Driv ip-op xittion qutions rom xittion t. Driv output qutions rom trnsition/output t. Drw oi irm tt sows omintion nxt-stt n output untions s w s ip-ops. CS Nwton/Pistr 8..29 CS Nwton/Pistr 8.. CS Sp 98 R. Nwton & K. Pistr

Guiins or Dtrminin Fip-Fop Equtions rom Nxt- Mp Typ D T EN S-R S R J-K J K Qn = Qn+= CS Nwton/Pistr Qn+= Qn = Qn+= Qn+ = Rus or ormin input mp rom nxtstt mp (2) Qn = no n no n Qn = no n ompmnt no n rp s wit s rp s wit s ompmnt no n i in wit s i in wit s ompmnt Nots: () = "on't r" (2) wys opy s rom nxt-stt mp to input mp irst () For S, Qn= n R, Qn=, i rminin ntris wit s. 8.. Fip-Fop Equtions From Nxt- Mp: Exmp Qn CS Nwton/Pistr 2 6 7 Qn 2 6 7 Qn 2 6 7 Qn+ nxt-stt mp D input mp T input mp Qn Qn S 2 6 7 Qn R 2 6 7 S-R input mp 2 6 7 Qn 2 6 7 J-K input mp J K 8..2 Nxt- Mps: Dsin Exmp Coos ip-op typs: D ip-ops R ssinmnts: q =, q =, q2 =, q =, q =, q =, q6 = Construt D input mps rom nxt-stt mp, sustitutin stt os. BC 2 8 9 7 2 6 BC 7 2 8 9 2 6 s BC 2 8 9 7 2 6 n+ Bn+ Cn+ Stps to FSM Dsin Construt stt/output t rom t wor sription (or stt rp). Minimiztion: Minimiz t numr o stts (usuy ps it). ssinmnt: Coos st o stt vris n ssin os to nm stts. Sustitut t stt-vri omintions into t stt/output t to rt trnsition/output t (nxt-stt t) tt sows t sir nxt-stt vri omintion or stt/input omintion. Construt nxt-stt K-mps s n. Coos ip-op typ (.. D, J-K, T) or t stt mmory. Construt n xittion t tt sows t ip-op input xittion vus rquir to otin t sir nxt-stt vu or stt/input omintion. Driv ip-op xittion qutions rom xittion t. Driv output qutions rom trnsition/output t. Drw oi irm tt sows omintion nxt-stt n output untions s w s ip-ops. CS Nwton/Pistr 8.. CS Nwton/Pistr 8.. Nxt- Mps: Summry o Exmp Driv Equtions rom Mps N 6 ts n t- to impmnt t min usin tis ssinmnt. Strit inry ssinmnt (q=, q=, t.) wou yi ts n 9 t-. T ppro v oo rsuts in tis xmp, ut tt is not wys t s. BC 7 2 2 6 mp rom Trnsition/ T 8 9 CS Nwton/Pistr 8.. CS Nwton/Pistr 8..6 CS Sp 98 R. Nwton & K. Pistr 6

Stps to FSM Dsin Construt stt/output t rom t wor sription (or stt rp). Minimiztion: Minimiz t numr o stts (usuy ps it). ssinmnt: Coos st o stt vris n ssin os to nm stts. Sustitut t stt-vri omintions into t stt/output t to rt trnsition/output t (nxt-stt t) tt sows t sir nxt-stt vri omintion or stt/input omintion. Construt nxt-stt K-mps s n. Coos ip-op typ (.. D, J-K, T) or t stt mmory. Construt n xittion t tt sows t ip-op input xittion vus rquir to otin t sir nxt-stt vu or stt/input omintion. Driv ip-op xittion qutions rom xittion t. Driv output qutions rom trnsition/output t. Drw oi irm tt sows omintion nxt-stt n output untions s w s ip-ops. CS Nwton/Pistr 8..7 CS Sp 98 R. Nwton & K. Pistr 7