Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!uunet!mcsun!ukc!strath-cs!wenbo
From: wenbo@cs.strath.ac.uk (Wenbo Mao)
Newsgroups: comp.theory
Subject: Equality of Finite State Machines
Message-ID: <6580@baird.cs.strath.ac.uk>
Date: 23 May 91 10:53:44 GMT
Sender: news@cs.strath.ac.uk
Organization: Comp. Sci. Dept., Strathclyde Univ., Scotland.
Lines: 12
Nntp-Posting-Host: maxwell

Could please anyone advise me any work done so far, which may show
FSM equivalence by SYNTACTIC reasoning (e.g., term rewriting, axiomatic
reasoning)? Is the problem concerning decidability?

Please exculde rewriting systems to do with FINITE OBJECTS (e.g., trees),
or EQUIVALENCE CHECKERS to do with SEMANTIC reasoning (e.g. state
partitioning, tableaux).

Thanks!

Wenbo Mao
wenbo@cs.strath.ac.uk