Reference : Is Büchi's theorem useful for you? (for an audience of logicians) |

Scientific congresses and symposiums : Unpublished conference/Abstract | |||

Physical, chemical, mathematical & earth Sciences : Mathematics | |||

http://hdl.handle.net/2268/205384 | |||

Is Büchi's theorem useful for you? (for an audience of logicians) | |

English | |

Rigo, Michel [Université de Liège > Département de mathématique > Mathématiques discrètes >] | |

17-Jan-2017 | |

No | |

Yes | |

Model Theory and Applications | |

from 16-01-2017 to 20-01-2017 | |

UMons | |

[en] Logic ; Combinatorics on words ; decidable theory | |

[en] Almost a century ago, Presburger showed that the first order theory of the natural numbers with addition is decidable. Following the work of B\"uchi in 1960, this result still holds when adding a function $V_k$ to the structure, where $V_k(n)$ is the largest power of $k\ge 2$ diving $n$. In particular, this leads to a logical characterization of the $k$-automatic sequences.
During the last few years, many applications of this result have been considered in combinatorics on words, mostly by J. Shallit and his coauthors. In this talk, we will present this theorem of B\"uchi where decidability relies on finite automata. Then we will review some results about automatic sequences or morphic words that can be proved automatically (i.e., the proof is carried on by an algorithm). Finally, we will sketch the limitation of this technique. With a single line formula, one can prove automatically that the Thue-Morse word has no overlap but, hopefully, not all the combinatorial properties of morphic words can be derived in this way. We will not assume any background in combinatorics on words from the audience. | |

Researchers | |

http://hdl.handle.net/2268/205384 |

File(s) associated to this reference | ||||||||||||||

| ||||||||||||||

All documents in ORBi are protected by a user license.