id: 06084458
dt: a
an: 06084458
au: Goč, Daniel; Henshall, Dane; Shallit, Jeffrey
ti: Automatic theorem-proving in combinatorics on words.
so: Moreira, Nelma (ed.) et al., Implementation and application of automata.
    17th international conference, CIAA 2012, Porto, Portugal, July
    17‒20, 2012. Proceedings. Berlin: Springer (ISBN
    978-3-642-31605-0/pbk). Lecture Notes in Computer Science 7381, 180-191
    (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-642-31606-7_16
ab: Summary: We describe a technique for mechanically proving certain kinds of
    theorems in combinatorics on words, using finite automata and a package
    for manipulating them. We illustrate our technique by applying it to
    (a) solve an open problem of Currie and Saari on the lengths of
    unbordered factors in the Thue-Morse sequence; (b) verify an old result
    of Prodinger and Urbanek on the paperfolding sequence and (c) find an
    explicit expression for the recurrence function for the Rudin-Shapiro
    sequence. All results were obtained by machine computations.
rv: