DFA - Deterministic Finite Automata And Regular Languages...

Info iconThis preview shows pages 1–17. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Deterministic Finite Automata And Regular Languages Deterministic Finite Automaton (DFA) Input Tape Accept or Reject String Finite Automaton Output Transition Graph initial state accepting state state transition q 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , b a , q 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , b a , } , { b a = For every state, there is a transition for every symbol in the alphabet Alphabet Initial Configuration 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , Input String a b b a b a , q Initial state Input Tape head Scanning the Input q 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , a b b a b a , q 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , a b b a b a , q 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , a b b a b a , q 1 q 2 q 3 q 4 q a b b a accept 5 q a a b b b a , a b b a b a , Input finished 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , a b a b a , q A Rejection Case Input String q 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , a b a b a , q 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , a b a b a , q 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , reject a b a b a , Input finished 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , b a , q ) ( Another Rejection Case Tape is empty reject Input Finished Language Accepted: { } abba L = q 1 q 2 q 3 q 4 q a b b a 5 q a a b b b a , b a , To accept a string: all the input string is scanned and the last state is accepting...
View Full Document

Page1 / 57

DFA - Deterministic Finite Automata And Regular Languages...

This preview shows document pages 1 - 17. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online