Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!infonode!ingr!b17a!ganesh
From: ganesh@b17a.ingr.com (Ganesh Subramaniam)
Newsgroups: comp.theory
Subject: Automata, Finite state machines.
Message-ID: <1991Feb14.160517.13481@b17a.ingr.com>
Date: 14 Feb 91 16:05:17 GMT
References: <1991Feb4.162458.6244@garfield.cs.mun.ca>
Reply-To: ganesh@b17a.UUCP (Ganesh Subramaniam)
Organization: Intergraph Corporation
Lines: 10

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.