No. Title Author Year
1 A Complexity Approach to Tree Algebras: the Bounded Case Colcombet, Thomas et al. 2021
2 Learning Automata and Transducers: A Categorical Approach Colcombet, Thomas et al. 2021
3 Optimal Transformations of Games and Automata Using Muller Conditions Casares, Antonio et al. 2021
4 Cost Automata, Safe Schemes, and Downward Closures Barozzini, David et al. 2020
5 Unambiguous Separators for Tropical Tree Automata Colcombet, Thomas et al. 2020
6 On Reachability Problems for Low-Dimensional Matrix Semigroups Colcombet, Thomas et al. 2019
7 Automata in the Category of Glued Vector Spaces Colcombet, Thomas et al. 2017
8 Automata Minimization: a Functorial Approach Colcombet, Thomas et al. 2017
9 Cost Functions Definable by Min/Max Automata Colcombet, Thomas et al. 2016
10 On a Fragment of AMSO and Tiling Systems Blumensath, Achim et al. 2016
11 The Bridge Between Regular Cost Functions and Omega-Regular Languages Colcombet, Thomas et al. 2016
12 Combinatorial Expressions and Lower Bounds Colcombet, Thomas et al. 2015
13 Fragments of Fixpoint Logic on Data Words Colcombet, Thomas et al. 2015
14 Generalized Data Automata and Fixpoint Logic Colcombet, Thomas et al. 2014
15 Playing Safe Colcombet, Thomas et al. 2014
16 Approximate comparison of distance automata Colcombet, Thomas et al. 2013
17 Deciding the weak definability of B├╝chi definable tree languages Colcombet, Thomas et al. 2013
18 Forms of Determinism for Automata (Invited Talk) Colcombet, Thomas 2012
Current Page :
Number of result pages: 1
Number of documents: 18


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI