ganesh@b17a.ingr.com (Ganesh Subramaniam) (02/15/91)
I am looking for solution/references regarding the following question: A finite state environment is said to be reduced iff, for all states p, q element of Q, if p is not the same as q, then there exists an action sequence 'A' such that pA and qA end in different states. Does there an efficient algorithm to reduce a given unreduced environment? Thanks in advance, Ganesh.