Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Michel Rigo, Manon Stipulanti, and Markus A. Whiteland. On Extended Boundary Sequences of Morphic and Sturmian Words. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 79:1-79:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{rigo_et_al:LIPIcs.MFCS.2022.79, author = {Rigo, Michel and Stipulanti, Manon and Whiteland, Markus A.}, title = {{On Extended Boundary Sequences of Morphic and Sturmian Words}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {79:1--79:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.79}, URN = {urn:nbn:de:0030-drops-168776}, doi = {10.4230/LIPIcs.MFCS.2022.79}, annote = {Keywords: Boundary sequences, Sturmian words, Numeration systems, Automata, Graph of addition} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Bernard Boigelot, Isabelle Mainz, Victor Marsault, and Michel Rigo. An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 118:1-118:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{boigelot_et_al:LIPIcs.ICALP.2017.118, author = {Boigelot, Bernard and Mainz, Isabelle and Marsault, Victor and Rigo, Michel}, title = {{An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {118:1--118:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.118}, URN = {urn:nbn:de:0030-drops-74317}, doi = {10.4230/LIPIcs.ICALP.2017.118}, annote = {Keywords: integer-base systems, automata, recognisable sets, periodic sets} }
Feedback for Dagstuhl Publishing