The following pages link to B. Boigelot (Q1014640):
Displaying 24 items.
- A generalization of Cobham's theorem to automata over real numbers (Q1014642) (← links)
- Counting the solutions of Presburger equations without enumerating them. (Q1426156) (← links)
- On iterating linear transformations over recognizable sets of integers (Q1884908) (← links)
- Symbolic methods and automata (Q2244827) (← links)
- Min max generalization for deterministic batch mode reinforcement learning: relaxation schemes (Q2873838) (← links)
- Automata-Based Symbolic Representations of Polyhedra (Q2890177) (← links)
- Acceleration of Affine Hybrid Transformations (Q3457778) (← links)
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (Q3519495) (← links)
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (Q3618581) (← links)
- (Q4219027) (← links)
- (Q4412567) (← links)
- (Q4518891) (← links)
- (Q4539644) (← links)
- (Q4809151) (← links)
- An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention (Q5111450) (← links)
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (Q5190326) (← links)
- A Generalization of Semenov’s Theorem to Automata over Real Numbers (Q5191120) (← links)
- An effective decision procedure for linear arithmetic over the integers and reals (Q5277733) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308434) (← links)
- A Generalization of Cobham’s Theorem to Automata over Real Numbers (Q5428861) (← links)
- The Power of Hybrid Acceleration (Q5756730) (← links)
- Computer Aided Verification (Q5900679) (← links)
- Computer Aided Verification (Q5900680) (← links)
- Non-emptiness test for automata over words indexed by the reals and rationals (Q6666789) (← links)
