P. 1
Automata

Automata

|Views: 132|Likes:
Published by Anoopa Chandran

More info:

Published by: Anoopa Chandran on Sep 27, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

01/26/2013

pdf

text

original

Let p and q are two states in DFA. Our goal is to understand when p and q
(p ≠ q) can be replaced by a single state.
Two states p and q are said to be distinguishable, if there is at least one
string, w, such that one of δ^ (p,w) and δ^ (q,w) is accepting and the other is not
accepting.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->