Skip to main content
  • CS202: Discrete Structures
    0%
  • Previous
  • More on Finite State Machines
    Course Introduction
    Course Syllabus
    Unit 1: Sets, Set Relations, and Set Functions
    1.1: Set Notation and Relations
    Set Notation and Relations
    Notation
    Try It Now
    1.2: Basic Set Operations
    Basic Set Operations
    Types of Sets
    Try It Now
    1.3: Cartesian Products and Power Sets
    Cartesian Products and Power Sets
    Try It Now
    1.4: Summation Notation and Generalizations
    Summation Notation and Generalizations
    Try It Now
    Unit 1 Assessment
    Unit 1 Assessment
    Unit 2: Counting Theory
    2.1: Rule of Products
    Introduction to the Rule of Products
    Try It Now
    2.2: Permutations
    Ordering Elements of a Set
    Try It Now
    2.3: Partitions of Sets and the Law of Addition
    Partitions and Addition Laws
    Try It Now
    2.4: Combinations and the Binomial Theorem
    Combinations and the Binomial Theorem
    Try It Now
    Unit 2 Assessment
    Unit 2 Assessment
    Unit 3: Mathematical Logic
    3.1: Propositions and Logical Operators
    Propositional Logic
    Propositions and Logical Operators
    Try It Now
    3.2: Truth Tables and Propositions Generated by a Set
    Summary of Logic Notation
    Truth Tables and Propositions Generated by a Set
    Try It Now
    3.3: Equivalence and Implication
    Equivalence and Implication
    Try It Now
    3.4: The Laws of Logic
    The Laws of Logic
    Try It Now
    Unit 3 Assessment
    Unit 3 Assessment
    Unit 4: Mathematical Induction and Proofs
    4.1: Mathematical Systems
    Mathematical Systems
    4.2: Direct Proof
    Direct Proof
    4.3: Indirect Proof
    Indirect Proof
    Try It Now
    4.4: Propositions over a Universe
    Propositions and Truth Sets
    Try It Now
    4.5: Mathematical Induction
    Discussion and Examples
    4.6: Strong Induction
    Strong Mathematical Induction
    Try It Now
    Unit 4 Assessment
    Unit 4 Assessment
    Unit 5: Probability
    5.1: Introduction
    Introduction to Discrete Probability
    5.2: Sample Spaces, Events, and Their Probabilities
    Sample Spaces, Events, and Their Probabilities
    Try It Now
    5.3: Complements, Intersections, and Unions
    Complements, Intersections, and Unions
    Try It Now
    5.4: Conditional Probability and Independent Events
    Conditional Probability
    Independent Events
    Try It Now
    Unit 5 Assessment
    Unit 5 Assessment
    Unit 6: Recursion
    6.1: Introduction
    Recursion Demystified
    Recursive Definitions
    6.2: Transitioning from Informal to Formal
    Collected Definitions of Recursion
    Explanation and Examples
    Illustrating Recursion
    Sequences and Recursion
    6.3: The Many Faces of Recursion
    The Many Faces of Recursion
    Try It Now
    6.4: Sequences
    Sequences
    Try It Now
    6.5: Recursion in the Real World
    Predicting Data Sample Values
    Unit 6 Assessment
    Unit 6 Assessment
    Unit 7: Graphs
    7.1: A Less-Formal Introduction
    Basic Graph Theory
    7.2: A Formal Introduction
    Introduction to Graphs
    Try It Now
    7.3: Graph Structures
    Data Structures for Graphs
    Try It Now
    7.4: Graph Node Connectivity
    Connectivity
    Try It Now
    7.5: Graph Traversals
    Traversals: Eulerian and Hamiltonian Graphs
    Try It Now
    7.6: Graph Optimization
    Graph Optimization
    Try It Now
    7.7: Planarity and Colorings
    Planarity and Colorings
    Try It Now
    Unit 7 Assessment
    Unit 7 Assessment
    Unit 8: Trees
    8.1: Introduction
    Quick Introduction to Trees
    Formal Introduction to Trees
    Try It Now
    8.2: Spanning Trees
    Overview of Spanning Trees
    Detailed Discussion of Spanning Trees
    Try It Now
    8.3: Rooted Trees
    Rooted Trees
    Try It Now
    8.4: Binary Trees
    Binary Trees
    Try It Now
    Unit 8 Assessment
    Unit 8 Assessment
    Unit 9: Finite-State Automata
    9.1: Introduction
    Finite-State Machine Overview
    More on Finite State Machines
    State Machines
    9.2: State Transition Diagrams
    State Transition Diagrams
    9.3: Finite-State Machine States
    FSM States
    FSM Examples
    9.4: Putting the Basics to Use
    Putting the Basics to Use
    Unit 9 Assessment
    Unit 9 Assessment
    Study Guide
    CS202 Study Guide
    Course Feedback Survey
    Course Feedback Survey
    Certificate Final Exam
    CS202: Certificate Final Exam
    Proctor-Verified Final Exam
    Archived Materials
  • Next
  • Course Catalog
    • All categories
    Arts & Humanities
    • Art History
    • Communication
    • English
    • Philosophy
    • Business Administration
    • Computer Science
    • English as a Second Language
    Professional Development
    • General Knowledge for Teachers
    Science and Math
    • Biology
    • Chemistry
    • Mathematics
    • Physics
    Social Science
    • Economics
    • Geography
    • History
    • Political Science
    • Psychology
    • Sociology
  • Home
  • Specialization Programs
    Specialization Programs MBA Degree Program
  • Help
    Getting Started Help Center & FAQ
Close
Toggle search input
You are currently using guest access
Log in
Course Catalog Collapse Expand
  • All categories
Arts & Humanities
  • Art History
  • Communication
  • English
  • Philosophy
  • Business Administration
  • Computer Science
  • English as a Second Language
Professional Development
  • General Knowledge for Teachers
Science and Math
  • Biology
  • Chemistry
  • Mathematics
  • Physics
Social Science
  • Economics
  • Geography
  • History
  • Political Science
  • Psychology
  • Sociology
Home Specialization Programs Collapse Expand
Specialization Programs MBA Degree Program
Help Collapse Expand
Getting Started Help Center & FAQ
Expand all Collapse all
  1. CS202: Discrete Structures
  2. Unit 9: Finite-State Automata
  3. 9.1: Introduction
  4. More on Finite State Machines

More on Finite State Machines

Completion requirements

This short video explains further.

 

Source: Chris Terman, https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-004-computation-structures-spring-2017/c6/c6s2/
 Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 License.

Last modified: Friday, 26 January 2024, 12:33 PM
Contact site support
You are currently using guest access (Log in)
Policies
Get the mobile app
Powered by Moodle

© Saylor Academy 2010-2024 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See detailed licensing information. Saylor Academy®, Saylor.org®, and Harnessing Technology to Make Education Free® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

Privacy Policy Terms & Conditions

Saylor Academy © 2010-2025 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See detailed licensing information. Saylor Academy®, Saylor.org®, and Harnessing Technology to Make Education Free® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.