[Back]

On MSO definability

  • 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).

  • Two-way automata and regular languages of overlapping tiles  (with A. Dicky), Fundamenta Informaticae  141:311-343, 2015  (doi)  (hal)  (pdf).

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

  • Inverse monoids of higher-dimensional strings, in International Colloquium on Theoretical Aspects of Computing (ICTAC), LNCS 9399, 2015 (hal)  (pdf) (related slides).

  • Free inverse monoids up to rewriting, , LaBRI, Université de Bordeaux, 2015  (url) .

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

  • Embedding finite and infinite words into overlapping tiles  (with A. Dicky), in Developments in Language Theory (DLT), LNCS 8633, pp 339-347, 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).

  • On languages of one-dimensional overlapping tiles, in Int. Conf. on Current Trends in Theo. and Prac. of Comp. Science (SOFSEM), LNCS 7741, pp 244-256, 2013  (doi)  (hal)  (pdf).

  • Overlaping tile automata, in 8th Int. Computer Science Symp. in Russia (CSR), LNCS 7913, pp 431-443, 2013  (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).

  • Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles, in Mathematical Found. of Comp. Science (MFCS), LNCS 7464, pp 516-528, 2012  (doi)  (hal)  (pdf).