Author of the publication

On defining linear orders by automata

, , and . Moscow Journal of Combinatorics and Number Theory, 9 (3): 253-291 (2020)Preprint: <a href="https://hal.archives-ouvertes.fr/hal-02397982/">Link</a><br>#journal.
DOI: 10.2140/moscow.2020.9.253

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A unified algorithm for colouring graphs of bounded clique-width., , and . (2020)http://arxiv.org/abs/2008.07468.Fly-automata, model-checking and recognizability., and . CoRR, (2014)Call by need computations in orthogonal term rewriting systems.. (2005)Autowrite: A Tool for Checking Properties of Term Rewriting Systems.. RTA, volume 2378 of Lecture Notes in Computer Science, page 371-375. Springer, (2002)A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation., and . J. Univers. Comput. Sci., 14 (20): 3282-3306 (2008)Decidable call-by-need computations in term rewriting., and . Inf. Comput., 196 (2): 95-126 (2005)Verifying Monadic Second Order Graph Properties with Tree Automata., and . ELS, page 7-21. ELSAA, (2010)Model-Checking by Infinite Fly-Automata., and . CAI, volume 8080 of Lecture Notes in Computer Science, page 211-222. Springer, (2013)Termination of linear bounded term rewriting systems., , and . RTA, volume 6 of LIPIcs, page 341-356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Model Checking with Fly-Automata., and . Encyclopedia of Algorithms, (2016)