TWiki> FST Web>FstQuickTour>IsomorphicDoc (revision 1)EditAttach

Isomorphic Work in progress, under construction

Description

This operations determines if two transducers have the same states and transitions irrespective of order.

Usage

template <class Arc>
bool Isomorphic(const Fst<Arc> &fst1,
                          const Fst<Arc> &fst2,
                          double delta = kDelta);
doc [bad link?]
fstisomorphic a.fst b.fst

Complexity

Isomorphic

  • Time: O(V1 + V2 + E1 log D1 + E2 log D2)
  • Space: O(D1 + D2)
where Vi = # of states, Ei = # of transitions, Di = maximum out-degree

Caveats

The inputs should be deterministic where each distinct (input label, output label, weight) triple of a transition is treated as a distinct label. If non-determinism in this sense is encountered, an error is raised. These restrictions are imposed since the general solution is graph isomorphism complete, a class thought to be between polynomial and NP-complete.

References

Zemlyachenko, Viktor N., Nickolay M. Korneenko, and Regina I. Tyshkevich. "Graph isomorphism problem." Journal of Soviet Mathematics 29.4 (1985): 1426-1481.

Edit | Attach | Watch | Print version | History: r6 | r4 < r3 < r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions...
Topic revision: r1 - 2014-04-22 - MichaelRiley
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2024 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback