[Back]

On birooted trees

  • Walking automata in free inverse monoids, in Int. Conf. on Current Trends in Theo. and Prac. of Comp. Science (SOFSEM), LNCS 9587, pp 314-328, 2016 (hal)  (pdf).

  • On Labeled Birooted Trees Languages: Algebras, Automata and Logic, Information and Computation  243:222-248, 2015  (doi)  (hal)  (pdf).

  • A syntactic congruence for languages of birooted trees  (with A. Blumensath), Semigroup Forum  , 2014  (doi)  (hal)  (pdf).

  • Towards a higher dimensional string theory for the modeling of computerized systems, in Int. Conf. on Current Trends in Theo. and Prac. of Comp. Science (SOFSEM), LNCS 8327, pp 7-20, 2014  (doi)  (hal)  (pdf) (related slides).

  • Algebras, automata and logic for languages of labeled birooted trees, in Int. Col. on Aut., Lang. and Programming (ICALP), LNCS 7966, pp 318-329, 2013  (doi)  (hal)  (pdf) (related slides).

  • Modélisation algébrique du diner des philosophes  (with A. Dicky), in Modélisation des Systèmes Réactifs (MSR), in Journal Européen des Systèmes Automatisés (JESA Volume 47 - no 1-2-3/2013), 2013  (doi)  (hal)  (pdf) (related slides).

  • Vers une modélisation combinatoire des structures rythmiques simples de la musique, Revue Francophone d'Informatique Musicale (RFIM)  2, 2012 (hal)  (pdf) (related slides).