Finite-state machines Lecture 8. Outcomes By the end of the session you should: – Understand what a state diagram is. – Understand the principles of a.

Slides:

Advertisements

Similar presentations

The Use of General Purpose Software as a Teaching Tool in Electronic Engineering Presenter:Martin R. Varley University of Central Lancashire, UK Co-Authors:Michael.

Advertisements

Sunken Millions Simple Machines Level One >>>> >>>>

How to configure the Microsoft Outlook Please click on Start, then click on Programs and Click on the Microsoft Office Outlook 2007.

Lecture 22: Sequential Circuits Today’s topic –Clocks and sequential circuits –Finite state machines 1.

Hte internets maze game.

Nonlinear & Neural Networks LAB. CHAPTER 19 State Machine Design with SM charts 19.1 State Machine Charts 19.2 Derivation of SM Charts 19.3 Realization.

§12.2 – Finite State Machines with Output. Giving credit where credit is due: Most slides based on lecture notes created byMost slides based on lecture.

Using MS Project To draw a Network diagram. Add tasks Add the 8 tasks listed for making a cup of tea. Add the duration of each –Note: MS Project doesn’t.

And Just Games etc.. EVOLUTION OF COMPUTER GAMES PongOdyssey Beginning of the use of microprocessors ATARI VCS system bit.

Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)

1 Lecture 14: FSM and Basic CPU Design Today’s topics:  Finite state machines  Single-cycle CPU Reminder: midterm on Tue 10/24  will cover Chapters.

Understanding your role as a School Rugby Ambassador.

Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.

1 times table 2 times table 3 times table 4 times table 5 times table

FSM How Finite State Machine is used to design a circuit.

Lecture 17 General finite state machine (FSM) design

Artificial Intelligence By Ryan Shoultes & Jeremy Creighton.

Finite State Machines – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Graphs and Finite State Machines Reading: Kolman, Sections.

Groups of the Periodic Table

Compound Events Defining Success In this lesson you will… find probabilities of compound events using organized lists, tables, tree diagrams, and simulation.

Finite-State Machines with Output

G042 - Lecture 16 Testing Your Spreadsheet Mr C Johnston ICT Teacher

Faxing 101: Using the Fax Machine (and yes, we have a fax machine!) How to use a calling card for a long-distance number:

Artificial Intelligence Techniques Artificial Stupidity?

From Machine Learning to Deep Learning. Topics that I will Cover (subject to some minor adjustment) Week 2: Introduction to Deep Learning Week 3: Logistic.

Introduction to Artificial Intelligence. Artificial Intelligence  AI is often divided into two basic ‘camps’  Rule-based systems (RBS)  Biological.

How many forces can you name?. Objectives Know a range of different forces and understand when they are present. Key terms: Force, effect, motion, balanced,

1 Lecture 22 Sequential Circuits Analysis. 2 Combinational vs. Sequential  Combinational Logic Circuit  Output is a function only of the present inputs.

Artificial Intelligence Techniques Introduction to Artificial Intelligence.

Machine Learning for an Artificial Intelligence Playing Tic-Tac-Toe Computer Systems Lab 2005 By Rachel Miller.

1 CSE370, Lecture 18 Lecture 20 u Logistics n HW6 due Wednesday n Lab 7 this week (Tuesday exception) n Midterm 2 Friday (covers material up to simple.

§12.2 – Finite State Machines with Output. Giving credit where credit is due: Most slides based on lecture notes created byMost slides based on lecture.

Slide 1 Project 1 Task 1 T&N3311 PJ1 Information & Communications Technology HD in Telecommunications and Networking Survey Form Simply put a cross in.

Lets Go Green!. Step 1 Save paper by using USB flash drive. Insert into copier, it’s easy!

Finite Automata Chapter 1. Automatic Door Example Top View.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

Groups of the Periodic Table. CONCLUSION…front of 13 1.Why is “shape” not a good test for determining if an element is a metal or a nonmetal? 2.You have.

Scratch Part 3 – Creating a level. What you will be doing.  You will make the first level to your game.  You need to think about the following when.

Tables Learning Support

Computer Architecture Lecture 5 Sequential Circuits Ralph Grishman September 2015 NYU.

Finite State Machine. Clock Clock cycle Sequential circuit Digital logic systems can be classified as combinational or sequential. – Combinational circuits.

Lets make Smoothies! We need: cup Created by Acrea P. McIntosh.

Chapter 13 Artificial Intelligence. Artificial Intelligence – Figure 13.1 The Turing Test.

Week 13 - Friday.  What did we talk about last time?  Regular expressions.

Making coffee Start or stop Process Decision Input/output Start

Finite State Machines Dr K R Bond 2009

How did life change for Jews in Nazi Germany between 1933 and 1939?

AS Computer Studies Finite State Machines 2.

Finite State Machines.

Lesson Objectives Aims

Principles of Computing – UFCFA3-30-1

Department of Mathematics (A

Principles of Computing – UFCFA3-30-1

Fig. 1. A diagram of artificial neural network consisting of multilayer perceptron. This simple diagram is for a conceptual explanation. When the logistic.

Lecture 20 Logistics Last lecture Today HW6 due Wednesday

Recap Lecture 15 Examples of Kleene’s theorem part III (method 3), NFA, examples, avoiding loop using NFA, example, converting FA to NFA, examples, applying.

Lecture 18 Logistics Last Lecture Today HW6 due today Midterm 2

Lecture 18 Logistics Last lecture Today HW5 due today (with extra 10%)

Robocon 2007 Electronics Quickstart!

click start under the teletubbie you want !!!!

3 times tables.

6 times tables.

UML State Diagrams.

In this task you will see different shapes.

Precedence tables and activity networks

How well do you KNOW your 2 times table ?

This session is being recorded

Most of the time, you need a whole machine to make coffee, and you may even have to grind some beans. To make tea, all you need.

Scratch – Simple Programming

Presentation transcript:

Finite-state machines Lecture 8

Outcomes By the end of the session you should: – Understand what a state diagram is. – Understand the principles of a finite state machine – Describe a simple system using a state diagram – Applications using state diagrams

What is a state?

State diagram (Taken from Picton 2004) Button? Cup? End? yes no yes State 0 wait for the button to be pressed State 1 wait for a cup to be placed State 2 wait for the coffee to be poured

Next-state table (Taken from Picton 2004)

Where are they used? Designing systems Games

Task 1 Your designing a character for a maze-based game. You must design a state diagram and table for the character.

BlockedEnd of Maze PresentYesNoYesNo

Further reading and references e e Picton PD (2004) CSY3011 Artificial Neural Networks, University College Northampton