Abstract
We present a new technique for computing the transitive closure of a regular relation characterized by a finite-state transducer. The construction starts from the original transducer, and repeatedly adds new transitions which are compositions of currently existing transitions.
Users
Please
log in to take part in the discussion (add own reviews or comments).