Author:
Boigelot Bernard,Latour Louis
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. 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.
2. Model-checking concurrent systems with unbounded integer variables;Bultan;ACM Trans. Programming Languages Systems (TOPLAS),1999
3. Logic and p-recognizable sets of integers;Bruyère;Bull. Belgian Math. Soc.,1994
4. 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.
5. On the base-dependence of sets of numbers recognizable by finite automata;Cobham;Math. Systems Theory,1969
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mata: A Fast and Simple Finite Automata Library;Lecture Notes in Computer Science;2024
2. Universal First-Order Quantification over Automata;Implementation and Application of Automata;2023
3. Bibliography;Formal Languages, Automata and Numeration Systems 2;2014-09-12
4. Bibliography;Formal Languages, Automata and Numeration Systems 1;2014-09-12
5. Integer affine transformations of parametric ℤ-polytopes and applications to loop nest optimization;ACM Transactions on Architecture and Code Optimization;2012-06