Computing with Mathematica. (English)
Orlando, FL: Academic Press. x \$ 49.95 (1998).
1
Well ordered subsets of linearly ordered sets (English)
Notre Dame Journal of Formal Logic 35, No. 3, 413-425 (1994).
2
Splaying a search tree in preorder takes linear time. (English)
Int. J. Math. Math. Sci. 14, No.3, 545-552 (1991).
3
On rational solution of the state equation of a finite automaton. (English)
Int. J. Math. Math. Sci. 11, No.2, 355-364 (1988).
4
On rational solution of the state equation of a finite automation (abstract only) (English)
ACM Conference on Computer Science, 437 (1987).
5
A normal form for some semigroups generated by idempotents. (English)
Fundam. Math. 84, 75-78 (1974).
6
A graph theoretic equivalent to the axiom of choice. (English)
Z. Math. Logik Grundlagen Math. 19, 191 (1973).
7