Decision problems among the main subfamilies of rational relations

RAIRO - Theoretical Informatics and Applications

Volumn 40, Issue 2, 2006, Pages 255-275

  Carton, Olivier ^a   Choffrut, Christian ^a   Grigorieff, Serge ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Decision problems; Multitape automata; Presburger arithmetics

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; DIGITAL ARITHMETIC; PROBLEM SOLVING; SET THEORY;

DECISION PROBLEMS; MULTITAPE AUTOMATA; PRESBURGER ARITHMETICS; RATIONAL SUBSETS;

DECISION THEORY;

EID: 33746301963     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2006005     Document Type: Article

References (15)

1. J. Berstel, Transductians and context-free languages. B.C. Teubner (1979).
2. A. Bertoni and P. Massazza, On the inclusion problem for finitely ambiguous rational trace languages. RAIRO: Inform. Théor. Appl. 32 (1998) 79-98.
3. S. Eilenberg, Automata, Languages and Machines, Vol. A. Academic Press (1974).
4. S. Eilenberg, C.C. Elgot and J.C. Shepherdson, Sets recognized by n-tape automata. J. Algebra 3 (1969) 447-464.
5. S. Eilenberg and M.-P. Schützenbeger, Rational sets in commutative monoids. J. Algebra 13 (1969) 173-191.
6. C.C. Elgot and J.E. Mezei, On Relations Defined by Finite Automata. IBM J. 10 (1965) 47-68.
7. P.C. Fischer and A.L. Rosenberg, Multitape one-way nonwriting automata. J. Comput. Syst. Sci. 2 (1968) 88-101.
8. S. Ginsburg and E.H. Spanier, Semigroups, Presburger formulas, and languages. Pacific J. Math. 16 (1966) 285-296.
9. E. Grädel, Subclasses of Presburger arithmetic and the polynomial hierarchy. Theoret. Comput. Sci. 56 (1989) 281-301.
10. O.H. Ibarra, The unsolvability of the equivalence problem for ε-free ngsm's with unary input (output) alphabets and application. SIAM J. Comput. 7 (1978) 520-532.
11. L.P. Lisovik, The identity problem for regular events over the direct product of free and cyclic semigroups. Dok. Akad. Nauk Ukrainskoj RSR Ser. A. 6 (1979) 410-413.
12. M. Rabin and D. Scott, Finite automata and their decision problems. IBM J. Res. Develop (1959) 125-144.
13. J. Sakarovitch, Éléments de théorie des automates. Vuibert Informatique (2003).
14. R.E. Stearns, A regularity test for pushdown machines. Inform. Control 11 (1967) 323-340.
15. L.G. Valiant, Regularity and related problems for deterministic pushdown automata. Inform. Control 22 (1975) 1-10.