| Publication | Date of Publication | Type |
|---|
| Non-emptiness test for automata over words indexed by the reals and rationals | 2025-01-20 | Paper |
| Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates | 2024-04-26 | Paper |
Universal first-order quantification over automata
Implementation and Application of Automata | 2024-02-28 | Paper |
Universal first-order quantification over automata
Implementation and Application of Automata | 2024-02-28 | Paper |
Efficient symbolic representation of convex polyhedra in high-dimensional spaces
Automated Technology for Verification and Analysis | 2023-07-28 | Paper |
| Symbolic methods and automata | 2021-11-12 | Paper |
An efficient algorithm to decide periodicity of \(b\)-recognisable sets using MSDF convention
(available as arXiv preprint) | 2020-05-27 | Paper |
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Acceleration of affine hybrid transformations
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
Min max generalization for deterministic batch mode reinforcement learning: relaxation schemes
SIAM Journal on Control and Optimization | 2014-01-27 | Paper |
Automata-based symbolic representations of polyhedra
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Iterating transducers in the large (extended abstract)
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Hybrid acceleration using real vector automata (extended abstract)
Lecture Notes in Computer Science | 2010-04-20 | Paper |
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Logical Methods in Computer Science | 2010-03-15 | Paper |
A Generalization of Semenov’s Theorem to Automata over Real Numbers
Automated Deduction – CADE-22 | 2009-07-28 | Paper |
A generalization of Cobham's theorem to automata over real numbers
Theoretical Computer Science | 2009-04-29 | Paper |
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
Language and Automata Theory and Applications | 2009-04-02 | Paper |
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Automata, Languages and Programming | 2008-08-19 | Paper |
A Generalization of Cobham’s Theorem to Automata over Real Numbers
Automata, Languages and Programming | 2007-11-28 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
The Power of Hybrid Acceleration
Computer Aided Verification | 2007-09-05 | Paper |
On iterating linear transformations over recognizable sets of integers
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2090515 (Why is no real title available?) | 2004-08-12 | Paper |
Counting the solutions of Presburger equations without enumerating them.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1949644 (Why is no real title available?) | 2003-07-15 | Paper |
| scientific article; zbMATH DE number 1765703 (Why is no real title available?) | 2002-07-10 | Paper |
| scientific article; zbMATH DE number 1538036 (Why is no real title available?) | 2001-02-05 | Paper |
| scientific article; zbMATH DE number 1223712 (Why is no real title available?) | 1999-02-14 | Paper |
