Discrete Structure

by MIRHANIEZA BINTI MATHARUZAMAN

About Discrete Structure

Computers use discrete structures to represent and manipulate data. Discrete mathematics describe processes that consist of a sequence of individual steps. This contrasts with calculus, which describes processes that change in a continous fashion.

The idea of discrete mathematics underlie the science and technology of the computer age.

Plans

 

Finite automata

Djikstra's shortest path algorithm

Completed Tutorial 3 - Completion date: 2 December 2018
Details

Discrete Structure RSS

Finite Automata

Posted on 10 December 2018, 10:15 AM

Deterministic Finite State Machine

  • Have initial and final state
  • Validity of string depends on final statedfa.png

Transition Table:

Transition+Table+(DFA).jpg

 

 

 

 

Finite State Machines

  • No final state
  • Validity of string depends on 1

790px-Turnstile_state_machine_colored.svg.png

Transition Table:

2010215332356340180155574025005891.jpg

Add comment
Details

Lecture Notes

Set Theory

ven.gif.jpg

Finite Automaton

Finite Automata.JPG

automaton.gif

Graph Theory

Isomorphic graph

isomorphic.png.1

Graph_cycle.gif

th.jpg

Updated on 10 December 2018, 10:15 AM; 485 page visits from 9 December 2018 to 28 October 2025