Back
  1. Home
  2. Profile of Laurent Waxweiler (ULiège)
Profil

Waxweiler Laurent

See author's contact details
Main Referenced Co-authors
Rigo, Michel  (5)
Charlier, Emilie  (4)
Rampersad, Narad  (4)
Main Referenced Keywords
Automata (2); Numeration system (2); automata (1); automate fini déterministe (1); Bertrand System (1);
Main Referenced Disciplines
Mathematics (6)
Computer science (5)

Publications (total 6)

The most downloaded
473 downloads
Waxweiler, L. (2009). Caractère reconnaissable d'ensembles de polynômes à coefficients dans un corps fini [Doctoral thesis, ULiège - Université de Liège]. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/11381 https://hdl.handle.net/2268/11381

The most cited

4 citations (OpenAlex)

Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2010). State complexity of testing divisibility. Electronic Proceedings in Theoretical Computer Science, 31, 48-57. doi:10.4204/EPTCS.31 https://hdl.handle.net/2268/64877

Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2011). The minimal automaton recognizing mN in a linear numeration system. Integers, 11B (A4), 1-24.
Peer Reviewed verified by ORBi

Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2010). Structure of the minimal automaton of a numeration language. In Actes de LaCIM 2010.
Peer reviewed

Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2010). State complexity of testing divisibility. Electronic Proceedings in Theoretical Computer Science, 31, 48-57. doi:10.4204/EPTCS.31
Peer Reviewed verified by ORBi

Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2010). Structure of the minimal automaton of a numeration language and applications to state complexity. In Actes des Journées Montoises d'Informatique Théorique.
Peer reviewed

Waxweiler, L. (2009). Caractère reconnaissable d'ensembles de polynômes à coefficients dans un corps fini [Doctoral thesis, ULiège - Université de Liège]. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/11381

Rigo, M., & Waxweiler, L. (2006). A note on syndeticity, recognizable sets and Cobham's theorem. Bulletin of the European Association for Theoretical Computer Science, 88, 169-173.
Peer reviewed

Contact ORBi