Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

A finite binary relation over a set S can be represented in ML by a list of 2 - tuples. Write an ML function transitive

A finite binary relation over a set S can be represented in ML by a list of 2-tuples. Write an ML function transitive that checks whether a relation is transitive.
You may define auxiliary functions. For instance,
- transitive;
val it = fn : (a *a) list -> bool
- transitive nil;
val it = true : bool
- transitive [(1,1)];
val it = true : bool
- transitive [(1,2),(1,4),(1,3)];
val it = true : bool
- transitive [(1,2),(1,4),(2,3)];
val it = false : bool
- transitive [(1,2),(1,4),(2,3),(1,3)];
val it = true : bool

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Introduction To Data Mining

Authors: Pang Ning Tan, Michael Steinbach, Vipin Kumar

1st Edition

321321367, 978-0321321367

More Books

Students also viewed these Databases questions