AUTOMATA - The Myhill-Nerode Theorem - KUMAR 7, undefined for Automata. Uttar Pradesh Technical University (UPTU)


Description: Lecture slides on:The Myhill-Nerode Theorem, Myhill-Nerode Relations, Relations b/t DFAs and Myhill-Nerode relations, isomorphism, bisimulation,Autobisimulation,
Showing pages  1  -  2  of  28
Transparency No. 10-1
Formal Language
and Automata Theory
Chapter 10
The Myhill-Nerode Theorem
(lecture 15,16 and B)
The Myhill-Nerode theorem
Transparency No. 10-2
Isomorphism of DFAs
M = (QM,S,dM,sM,FM), N = (QN,S, dN,sN,FN): two DFAs
M and N are said to be isomorphic if there is a bijection f:QM->
f(sM) = sN
f(dM(p,a)) = dN(f(p),a) for all p QM, a S
p FMiff f(p) FN.
I.e., M and N are essentially the same machine up to renaming
of states.
1. Isomorphic DFAs accept the same set.
2. if M and N are any two DFAs w/o inaccessible states
accepting the same set, then the quotient automata M/and
N/ are isomorphic
3. The DFA obtained by the collapsing algorithm (lec. 14) is
the minimal DFA for the set it accepts, and this DFA is
unique up to isomorphism.
The preview of this document ends here! Please or to read the full document or to download it.
Document information
Uploaded by: nihira
Views: 3569
Downloads : 1
Address: Engineering
University: Uttar Pradesh Technical University (UPTU)
Subject: Automata
Upload date: 01/09/2011
Embed this document:
Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome