Decision problems among the main subfamilies of rational relations

We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we investigate the following decision problem: given a relation in one of the families, does it belong to a smaller family? We settle the problem entirely when all monoids have a unique generator and fill some gaps in the general case. In particular, adapting a proof of Stearns, we show that it is recursively decidable whether or not a deterministic subset of an arbitrary number of free monoids is recognizable. Also we exhibit a single exponential algorithm for determining if a synchronous relation is recognizable.

[1]  Thomas Sudkamp,et al.  Languages and Machines , 1988 .

[2]  Berndt Farwer,et al.  ω-automata , 2002 .

[3]  Alberto Bertoni,et al.  On the Inclusion Problem for Finitely Ambiguous Rational Trace Languages , 1998, RAIRO Theor. Informatics Appl..

[4]  Arnold L. Rosenberg,et al.  Multitape One-Way Nonwriting Automata , 1968, J. Comput. Syst. Sci..

[5]  Oscar H. Ibarra.  The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications , 1978, SIAM J. Comput..

[6]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[7]  R. E. Sm.  A Regularity Test for Pushdown Machines , 2004 .

[8]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[9]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[10]  M. Schützenberger,et al.  Rational sets in commutative monoids , 1969 .

[11]  C. C. Elgot,et al.  Sets recognized by n-tape automata , 1969 .

[12]  Jorge E. Mezei,et al.  On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..

[13]  Erich Grädel.  Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy , 1988, Theor. Comput. Sci..

[14]  Joseph P. Noonan,et al.  The Mutual Information Principle and Applications , 1973, Inf. Control..

[15]  Leslie G. Valiant,et al.  Regularity and Related Problems for Deterministic Pushdown Automata , 1975, JACM.

[16]  J. Sakarovitch.  Eléments de théorie des automates , 2003 .