Mealy Machines Finite State Machines with Outputs given on the transitions.

Slides:



Advertisements
Similar presentations
Variants of Turing machines
Advertisements

Rules of Divisibility. Divisible by 2? If the last digit is even then the number is divisible by 2. Even digits are 0, 2, 4, 6 and 8 (yes zero is even!)
DATA REPRESENTATION CONVERSION.
Software Engineering, COMP 201 Slide 1 Automata and Formal Languages Moore and Mealy Automata Ralf Möller Hamburg Univ. of Technology based on slides by.
Finite Automata with Output
CS 151 Digital Systems Design Lecture 21 Analyzing Sequential Circuits.
Fall 2004COMP 3351 Turing Machines. Fall 2004COMP 3352 The Language Hierarchy Regular Languages Context-Free Languages ? ?
1 Computing Functions with Turing Machines. 2 A function Domain: Result Region: has:
Chapter Chapter Goals Know the different types of numbers Describe positional notation.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
1 Sequences and Mathematical Induction An important task of mathematics is to discover and characterize regular patterns, such as those associated with.
Binary Numbers.
Data Representation in Computers. Data Representation in Computers/Session 3 / 2 of 33 Number systems  The additive approach – Number earlier consisted.
Rounding Numbers to the 100 Thousands Place
Finite-State Machines with Output
Lecture 23: Finite State Machines with no Outputs Acceptors & Recognizers.
Chapter 2 Binary Values and Number Systems. 2 2 Natural Numbers Zero and any number obtained by repeatedly adding one to it. Examples: 100, 0, 45645,
Repeated Subtraction: Division
Number systems, Operations, and Codes
Moore machine and Mealy machine (P.274)
Section 2.6 Representation of numbers. Decimal representation (base 10) Given a positive integer X, the decimal representation of X is a string of digits.
Copyright©amberpasillas2010. Integer Addition Rules If the signs are the SAME Add the numbers. The sign stays the same = =
Chapter 8 L8-4 Notes: Multiplying Integers. Study the examples below and see if you spot any patterns. Can you figure out the rules for multiplying and.
Objective: SWBAT Multiply and Divide Integers Fill in Planner: Practice 1-9 Agenda  Note Taking WS  Multiply and divide integers matching  Independent.
DIVISIBILITY RULES.
Divisibility Rules and Finding Factors
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI 230 Models of Computation - Turing Machines Dale Roberts, Lecturer.
ANALYSIS OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
 Lecture 2 Processor Organization  Control needs to have the  Ability to fetch instructions from memory  Logic and means to control instruction sequencing.
Lecture 8 Theory of AUTOMATA
Number Representation Lecture Topics How are numeric data items actually stored in computer memory? How much space (memory locations) is.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Computing Machinery Chapter 4: Finite State Machines.
Theory of computing, part 4. 1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of.
Lecture 22: Finite State Machines with Output. Moore Machine - A Moore machine is a 6-tuple (Q, , , , q 0,  ) where, (1) Q is a finite set of states.
Converting Fractions to Decimals. Parts of a Fraction 3 4 = the number of parts = the total number of parts that equal a whole.
Converting Decimals to Fractions Goal: use place values to make fractions.
1 Introduction to Turing Machines
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 12 Mälardalen University 2007.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Solve One Step Inequalities. ˂ ˃ Comparison Symbols ˃ ˂ Less Than Greater Than Less Than or equal to Greater Than or equal to - and how to graph x Open.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
1 Computing Functions with Turing Machines. 2 A function Domain Result Region has:
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Lecture 14: Theory of Automata:2014 Finite Automata with Output.
Finite Automata.
Deterministic Finite Automata
Computing Functions with Turing Machines
Turing Machines 2nd 2017 Lecture 9.
Deterministic Finite Automata
Multiplying & Dividing Integers
Multiplying and Dividing Integers
Theory of Computation Turing Machines.
CSE322 Mealy and Moore Machine
Computing Functions with Turing Machines
Divisibility Rules.
Choose the best answer for each problem.
Divisibility Rules.
Tests of Divisibility 1 - All integers can be divided by 1
Decimal / Binary Conversions
Converting to Base-n from Base-10
COMS 161 Introduction to Computing
DIRECTED NUMBERS.
FUNCTION MACHINES This is a function machine: Input output
DIVISION OF INTEGERS 1-9.
Integers Blast Off
Subtracting integers without number line 3 digit.
SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.
Divide two Integers.
Adding integers without number line 2 digit.
Presentation transcript:

Mealy Machines Finite State Machines with Outputs given on the transitions

Machines with Outputs Mealy machines can output symbols. The symbols it can output are determined by a pre-defined alphabet. The output and input alphabets are independent from each other and are often made up of different symbols. Outputs are shown on the transition arrow, and are initiated when the transition is followed. A backslash is used to separate inputs and outputs from each other. input / output

Example Mealy Machine #1 We will now build a Mealy machine that reverses the input given to it. We can do this in one state, with just two transitions! Here we are saying that if the input is 0 then output a 1. If we read in a 1 then output a 0. This repeats until the end of the string. a 0 / 1 1 / 0

Example Mealy Machine #2 We will now look at a Mealy machine that takes base 10 numbers as its input. It will output a 1 if the number is divisible by 3, and a 0 if not. The number is read from left to right. e.g. 126 → 011 State a reads a 1 Output 0 – move to state b State b reads a 2 Output 1 – move to state a State a reads a 6 Output 1 – stay in state a End of input – last output was a 1, so number is divisible by 3.

Mealy Challenge Integer Division of Binary Numbers Write a Mealy machine that integer divides binary numbers by 2. e.g → → → → → → → → 011 Can you spot a pattern here? What is happening to each number? You can do this using just two states. Use the following logic rule to help you: If digit is a 1, then replace it with a 0 and replace the next zero with a 1.

Mealy Machine to Integer Divide Binary Numbers a b

Mealy Challenge - Answer a 0 / 0 b 1 / 0 1 / 1 0 / 1