Let S be a rational projective surface given by means of parametrization whose base locus satisfies mild assumption. In this paper we present an algorithm that provides three maps f,g,h:A2⇢S⊂Pn such the union images covers S. As consequence, second generates two f,g˜:A2⇢S, its affine S∩An. case, number involved in cover is general optimal.

T h e preface paradox strikes us as puzzling because we feel that if a person holds a set of inconsistent beliefs, i.e. beliefs such that at least one of them must be incorrect, then he should give at least one of them up. Equally, if a person’s belief is rational, then he has a right to hold it. Yet the preface example is prima facie a case in which a person holds an inconsistent set of belief...

Although they can be topologically different, two distinct transducers may actually recognize the same rational relation. Being able to test the equivalence of transducers allows to implement such operations as incremental minimization and iterative composition. This paper presents an algorithm for testing the equivalence of deterministic weighted finite-state transducers, and outlines an imple...