1 / 47

# Deterministic Finite Automaton (DFA) - PowerPoint PPT Presentation

Deterministic Finite Automaton (DFA). Input Tape. String. Output. “Accept” or “Reject”. Finite Automaton. Formal Definition. Deterministic Finite Automaton (DFA). : set of states. : input alphabet. : transition function. : initial state. : set of accepting states.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Deterministic Finite Automaton (DFA)' - leone

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

Input Tape

String

Output

“Accept”

or

“Reject”

Finite

Automaton

Costas Busch - RPI

• Deterministic Finite Automaton (DFA)

: set of states

: input alphabet

: transition function

: initial state

: set of accepting states

Costas Busch - RPI

Costas Busch - RPI

initial

state

accepting

state

transition

state

Costas Busch - RPI

for every symbol in the alphabet

Costas Busch - RPI

Example

Costas Busch - RPI

:the input alphabet never contains

Example

Costas Busch - RPI

Example

Costas Busch - RPI

Example

Costas Busch - RPI

Describes the result of a transition

from state with symbol

Costas Busch - RPI

Costas Busch - RPI

symbols

states

Costas Busch - RPI

all the input string is scanned

and the last state is accepting

To reject a string:

all the input string is scanned

and the last state is non-accepting

Costas Busch - RPI

Input Tape

Input String

Initial state

Costas Busch - RPI

Costas Busch - RPI

accept

Costas Busch - RPI

Input String

Costas Busch - RPI

reject

Costas Busch - RPI

Tape is empty

Input Finished

reject

Costas Busch - RPI

Describes the resulting state

after scanning string from state

Costas Busch - RPI

Costas Busch - RPI

Accept

state

Accept

state

Accept

state

Costas Busch - RPI

Input Finished

accept

Costas Busch - RPI

trap state

Accept

state

Costas Busch - RPI

Costas Busch - RPI

accept

Costas Busch - RPI

Input String

Costas Busch - RPI

reject

Costas Busch - RPI

Costas Busch - RPI

Alphabet:

Language Accepted:

Costas Busch - RPI

Empty language

All strings

Costas Busch - RPI

Costas Busch - RPI

= { all strings with prefix }

Costas Busch - RPI

={ all binary strings containing substring }

Costas Busch - RPI

={ all binary strings without substring }

Costas Busch - RPI