@inproceedings{10.1007/978-3-030-85088-3_1,
    Abstract = {The notion of synchronized sequence, introduced by Carpi and Maggi in 2002, has turned out to be a very useful tool for investigating the properties of words. Moreover, if sequence is synchronized, then one can use a theorem-prover such as Walnut to ``automatically'' prove many results about it, with little human intervention. In this paper I will prove some of the basic properties of synchronization, and give a number of applications to combinatorics on words.},
    Address = {Berlin, Heidelberg},
    Author = {Shallit, Jeffrey},
    BookTitle = {Combinatorics on Words: 13th International Conference, WORDS 2021, Rouen, France, September 13--17, 2021, Proceedings},
    File = {Synchronized Sequences - words21.pdf},
    ISBN = {978-3-030-85087-6},
    Keywords = {Automata, Combinatorics on words, Theorem-prover, Automatic sequence, Synchronized sequence, Regular sequence},
    Pages = {1--19},
    Publisher = {Springer-Verlag},
    Title = {Synchronized Sequences},
    URL = {https://doi.org/10.1007/978-3-030-85088-3\_1},
    Year = {2021},
    bdsk-url-1 = {https://doi.org/10.1007/978-3-030-85088-3\_1},
    date-added = {2023-08-26 09:52:09 +0200},
    date-modified = {2023-08-26 09:52:09 +0200},
    numpages = {19},
    doi = {10.1007/978-3-030-85088-3_1}
}

@inproceedings{10.1007/978-3-030-85088-3_1, Abstract = {The notion of synchronized sequence, introduced by Carpi and Maggi in 2002, has turned out to be a very useful tool for investigating the properties of words. Moreover, if sequence is synchronized, then one can use a theorem-prover such as Walnut to ``automatically'' prove many results about it, with little human intervention. In this paper I will prove some of the basic properties of synchronization, and give a number of applications to combinatorics on words.}, Address = {Berlin, Heidelberg}, Author = {Shallit, Jeffrey}, BookTitle = {Combinatorics on Words: 13th International Conference, WORDS 2021, Rouen, France, September 13--17, 2021, Proceedings}, File = {Synchronized Sequences - words21.pdf}, ISBN = {978-3-030-85087-6}, Keywords = {Automata, Combinatorics on words, Theorem-prover, Automatic sequence, Synchronized sequence, Regular sequence}, Pages = {1--19}, Publisher = {Springer-Verlag}, Title = {Synchronized Sequences}, URL = {https://doi.org/10.1007/978-3-030-85088-3_1}, Year = {2021}, bdsk-url-1 = {https://doi.org/10.1007/978-3-030-85088-3_1}, date-added = {2023-08-26 09:52:09 +0200}, date-modified = {2023-08-26 09:52:09 +0200}, numpages = {19}, doi = {10.1007/978-3-030-85088-3_1} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge