On iterating linear transformations over recognizable sets of integers

Theoretical Computer Science

Volumn 309, Issue 1-3, 2003, Pages 413-468

  Boigelot, Bernard ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

Automata; Iterations; Presburger arithmetic; Recognizable sets of integers

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY; VECTORS;

PRESBURGER ARITHMETIC;

FINITE AUTOMATA;

EID: 0242692667     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00314-1     Document Type: Article

References (30)

1. Aho A., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading, MA.
2. Bodewig E. Matrix Calculus. 2nd ed. 1959;Elsevier, North-Holland, Amsterdam.
3. B. Boigelot, Symbolic methods for exploring infinite state spaces, Collection des Publications de la Faculté des Sciences Appliquées de l'Université de Liège, Liège, Belgium, 1999.
4. B. Boigelot, L. Bronne, S. Rassart, An improved reachability analysis method for strongly linear hybrid systems, in: Proc. 9th Internat. Conf. Computer-Aided Verification, Haifa, Israel, June 1997, Lecture Notes in Computer Science, Vol. 1254, Springer, Berlin, pp. 167-177.
5. B. Boigelot, P. Godefroid, Symbolic verification of communication protocols with infinite state spaces using QDDs, in: Proc. Computer Aided Verification, New-Brunswick, NJ, July 1996, Lecture Notes in Computer Science, Vol. 1102, Springer, Berlin, pp. 1-12.
6. B. Boigelot, P. Godefroid, B. Willems, P. Wolper, The power of QDDs, Proc. 4th Static Analysis Symposium, Lecture Notes in Computer Science, Vol. 1302, Springer, Berlin, pp. 172-186.
7. A. Bouajjani, P. Habermehl, Symbolic reachability analysis of FIFO channel systems with nonregular sets of configurations, in: Proc. ICALP'97, Bologna, Italy, July 1997, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, pp. 560-570.
8. A. Boudet, H. Comon, Diophantine equations, Presburger arithmetic and finite automata, in: Proc. CAAP'96, Lecture Notes in Computer Science, Vol. 1059, Springer, Berlin, 1996, pp. 30-43.
9. V. Bruyère, Entiers et automates finis, Mémoire de fin d'études, Université de Mons, 1985.
10. Bruyère V., Hansel G., Michaux C., Villemaire R. Logic and. p -recognizable sets of integers Bull. Belgian Math. Soc. 1(2):1994;191-238.
11. Büchi J.R. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlag. Math. 6:1960;66-92.
12. Church A. A note on the entscheidungsproblem. J. Symbolic Logic. 1:1936;40-41, 101-102.
13. Cobham A. On the base-dependence of sets of numbers recognizable by finite automata. Math. Systems Theory. 3:1969;186-192.
14. Compton K.J., Henson C.W. A uniform method for proving lower bounds on the computational complexity of logical theories. Ann. Pure Appl. Logic. 48:1990;1-79.
15. Ferrante J., Rackoff C.W. The Computational Complexity of Logical Theories. Lecture Notes in Mathematics. Vol. 718:1979;Springer, Berlin, Heidelberg, New York.
16. Franklin J.N. Matrix Theory, Prentice-Hall Series in Applied Mathematics. 1968;Prentice-Hall, Englewood Cliffs, NJ.
17. Henriksen J.G., Jensen J.L., Jø rgensen M.E., Klarlund N., Paige R., Rauhe T., Sandholm A. Mona: Monadic second-order logic in practice. Brinksma E., Cleaveland R., Larsen K.G., Margaria T., Steffen B. Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science. Vol. 1019:1995;89-110 Springer, Berlin.
18. J.E. Hopcroft, An nlog n algorithm for minimizing states in a finite automaton, Theory of Machines and Computation, Academic, New York 1971, pp. 189-196.
19. Ireland K., Rosen M. A Classical Introduction to Modern Number Theory. 2nd ed. Graduate Texts in Mathematics. Vol. 84:1990;Springer, Berlin.
20. The Liège Automata-based Symbolic Handler (LASH). Available at http://www.montefiore.ulg.ac.be/̃boigelot/research/lash/.
21. MacNaughton R. Review of [11]. J. Symbolic Logic. 28:1963;100-102.
22. k 〉 C. R. Acad. Sci. Paris. 303:1986;939-942.
23. Michaux C., Villemaire R. Presburger arithmetic and recognizability of sets of natural numbers by automata. new proofs of Cobham's and Semenov's theorems Ann. Pure Appl. Logic. 77(3):1996;251-277.
24. 22pn upper bound on the complexity of Presburger arithmetic J. Comput. System Sci. 16:1978;323-332.
25. M. Presburger, Über die Volständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, in: Comptes Rendus du Premier Congrès des Mathématiciens des Pays Slaves, Warsaw, Poland, 1929, pp. 92-101.
26. Pugh W. The Omega test: a fast and practical integer programming algorithm for dependence analysis. Comm. ACM. 35:1992;102-114.
27. Semenov A.L. Presburgerness of predicates regular in two number systems. Siberian Math. J. 18:1977;289-299.
28. Stewart I., Tall D. Algebraic Number Theory, Chapman & Hall Mathematics Series. 1979;Wiley, New York.
29. l〉 is undecidable Theor. Comput. Sci. 106:1992;337-349.
30. P. Wolper, B. Boigelot, On the construction of automata from linear arithmetic constraints, in: Proc. TACAS, Lecture Notes in Computer Science, Vol. 1785, Springer, Berlin, 2000, pp. 1-19.