Searching for "Factorisation of Finite State Machines under Strong and Observational Equivalences." – sorted by Relevance.
-
Computing, 1(1):85--114, 1989. [Nip89] Tobias Nipkow. Term rewriting and beyond - theorem proving in Isabelle.
- (6A):612--637, 1992. [QL91] Huajun Qin and Philip Lewis. Factorisation of finite state machines under
- Add To MetaCart
-
Formal Aspects of Computing Bibliography
- machines under strong and observational equivalences. Formal Aspects of Computing, 3(3):284--307, 1991
- Add To MetaCart

