Article View: comp.theory
Article #1664Equality of Finite State Machines
From: Wenbo Mao
Date: Thu, 23 May 1991 10:53
Date: Thu, 23 May 1991 10:53
12 lines
830 bytes
830 bytes
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
Technical Details
Message-ID:
<6580@baird.cs.strath.ac.uk>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!uunet!mcsun!ukc!strath-cs!wenboShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!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