Boigelot, B., Brusten, J., & Degbomont, J.-F. (March 2012). Automata-Based Symbolic Representations of Polyhedra. Lecture Notes in Computer Science, 7183, 3-20. doi:10.1007/978-3-642-28332-1_2 |
Brusten, J. (2011). On the sets of real vectors recognized by finite automata in multiple bases [Doctoral thesis, ULiège - Université de Liège]. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/92036 |
Boigelot, B., Brusten, J., & Degbomont, J.-F. (2010). Implicit Real Vector Automata. Electronic Proceedings in Theoretical Computer Science, 39, 63-76. doi:10.4204/EPTCS.39.5 Peer Reviewed verified by ORBi |
Boigelot, B., Brusten, J., & Bruyère, V. (2010). On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. Logical Methods in Computer Science, 6 (1), 1-17. doi:10.2168/LMCS-6(1:6)2010 Peer Reviewed verified by ORBi |
Boigelot, B., & Brusten, J. (2009). A generalization of Cobham's theorem to automata over real numbers. Theoretical Computer Science, 410 (18), 1694-1703. doi:10.1016/j.tcs.2008.12.051 Peer Reviewed verified by ORBi |
Boigelot, B., Brusten, J., & Leroux, J. (2009). A Generalization of Semenov's Theorem to Automata over Real Numbers. Lecture Notes in Computer Science, 5663, 469-484. doi:10.1007/978-3-642-02959-2_34 Peer reviewed |
Boigelot, B., Brusten, J., & Bruyère, V. (July 2008). On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. Lecture Notes in Computer Science, 5126, 112-123. doi:10.1007/978-3-540-70583-3_10 Peer reviewed |
Boigelot, B., & Brusten, J. (July 2007). A Generalization of Cobham's Theorem to Automata over Real Numbers. Lecture Notes in Computer Science, 4596, 813-824. doi:10.1007/978-3-540-73420-8_70 Peer reviewed |