Scribd
Upload
19 views10 pages

Myhill Nerode

This document describes the Myhill-Nerode method for state minimization of a finite state automaton (FSA). It outlines the following steps: 1. Create a table with the number of rows and columns equal to the number of states. Mark pairs of states where one is final and one is non-final. 2. Search the table for empty spaces between state pairs. If applying the same input leads both states to reach different states with no tick mark between them, those states can be merged. 3. Repeat step 2 until no more state pairs can be merged, resulting in the minimized FSA.

Uploaded by

amukhopadhyay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
19 views10 pages

Myhill Nerode

This document describes the Myhill-Nerode method for state minimization of a finite state automaton (FSA). It outlines the following steps: 1. Create a table with the number of rows and columns equal to the number of states. Mark pairs of states where one is final and one is non-final. 2. Search the table for empty spaces between state pairs. If applying the same input leads both states to reach different states with no tick mark between them, those states can be merged. 3. Repeat step 2 until no more state pairs can be merged, resulting in the minimized FSA.

Uploaded by

amukhopadhyay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 10

State Minimization using Myhill-Nerode method

Abhishek Mukhopadhyay 14-04-2014

Myhill-Nerode overview

ro!edure to do state minimization


"#ample

Step I
Form a table with size equal to the number of

states. Find out the pair with one non-final and one final states. Put a tick mark in the corresponding box.

i!torial view o$ step %

State minimization
Step %% Now sear!h $or the blank spa!e
&or e'g' between (r,t)* i$ we apply input +a, on both states* t will rea!h s and r will rea!h r itsel$' So nest state pair is s' So !he!k it whether i$ there is any ti!k mark between (s,r) or not'

i!torial view o$ step %%

-onstru!tion o$ minimized &SA


.his pro!ess will stop when we will $ind out that there is no more !onne!tion between pair o$ states'

For pair (p,t ! if we appl" a on both p and t! the" will reach q and s respecti#el". $ut there is no tick mark between q and s. So (p,t and (q,s will be merged.

Minimized &SA

You might also like