wenbo@cs.strath.ac.uk (Wenbo Mao) (05/23/91)
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