Deciding Whether or Not a Synchronous Relation is Regular Prefix

Article type: Research Article

Authors: Choffrut, Christian

Affiliations: L.I.A.F.A., Université Paris 7, France. christian.choffrut@sfr.fr

Note: [] Address for correspondence: L.I.A.F.A., Université Paris 7, France

Abstract: Eilenberg and al. introduced and studied in the late sixties the family of n-ary relations over the free monoid recognized by finite n-tape automata where the where the n reading heads tapes move simultaneously from left to right. We call these relations synchronous. In the eighties Angluin and Hoover and then Läuchli and Savioz introduced a proper subfamily which the first authors called regular prefix. Our main result shows that given a synchronous relation it is decidable whether or not it is regular prefix. Incidentally we also show that the family of regular prefix relations is uniformizable in the sense that all such relations contain a partial function with the same domain whose graph is a regular prefix relation.

DOI: 10.3233/FI-2014-1053

Journal: Fundamenta Informaticae, vol. 132, no. 4, pp. 439-459, 2014