The following pages link to Thomas Colcombet (Q290902):
Displaying 50 items.
- Approximate comparison of functions computed by distance automata (Q290904) (← links)
- Tree-walking automata cannot be determinized (Q817841) (← links)
- On the positional determinacy of edge-labeled games (Q818128) (← links)
- Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
- Automata and program analysis (Q1679950) (← links)
- The factorisation forest theorem (Q2074219) (← links)
- Controlling a random population (Q2200817) (← links)
- Universal graphs and good for games automata: new tools for infinite duration games (Q2289060) (← links)
- (Q2842873) (← links)
- Regular Cost Functions, Part I: Logic and Algebra over Words (Q2846575) (← links)
- Forms of Determinism for Automata (Invited Talk) (Q2904745) (← links)
- Asymptotic Monadic Second-Order Logic (Q2922005) (← links)
- Size-Change Abstraction and Max-Plus Automata (Q2922015) (← links)
- Combinatorial Expressions and Lower Bounds. (Q2955000) (← links)
- (Q2957917) (← links)
- (Q2958524) (← links)
- Generalized Data Automata and Fixpoint Logic (Q2978519) (← links)
- Playing Safe (Q2978529) (← links)
- Green’s Relations and Their Use in Automata Theory (Q3004564) (← links)
- Regular Languages of Words over Countable Linear Orderings (Q3012914) (← links)
- (Q3086920) (← links)
- On the Use of Guards for Logics with Data (Q3088044) (← links)
- Logics with rigidly guarded data tests (Q3196341) (← links)
- Limited Set quantifiers over Countable Linear Orderings (Q3449472) (← links)
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (Q3519517) (← links)
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (Q3540194) (← links)
- Tree-walking automata do not recognize all regular languages (Q3581424) (← links)
- Regular Temporal Cost Functions (Q3587468) (← links)
- Tree-Walking Automata Do Not Recognize All Regular Languages (Q3624380) (← links)
- The Theory of Stabilisation Monoids and Regular Cost Functions (Q3638091) (← links)
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (Q3638092) (← links)
- (Q4449206) (← links)
- (Q4580203) (← links)
- (Q4596779) (← links)
- The Bridge Between Regular Cost Functions and Omega-Regular Languages (Q4598268) (← links)
- On a Fragment of AMSO and Tiling Systems (Q4601871) (← links)
- (Q4601881) (← links)
- Two-way cost automata and cost logics over infinite trees (Q4635599) (← links)
- The Complexity of Boundedness for Guarded Logics (Q4635812) (← links)
- Games with bound guess actions (Q4635881) (← links)
- AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS (Q4692085) (← links)
- (Q4737148) (← links)
- Composition with Algebra at the Background (Q4928503) (← links)
- (Q5028432) (← links)
- The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
- On Reachability Problems for Low-Dimensional Matrix Semigroups (Q5091195) (← links)
- (Q5109522) (← links)
- (Q5111267) (← links)
- (Q5144609) (← links)
- (Q5144652) (← links)
