Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Marie-Pierre Béal
@inproceedings{DBLP:conf/dlt/BealC23, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore}, editor = {Frank Drewes and Mikhail Volkov}, title = {Fast Detection of Specific Fragments Against a Set of Sequences}, booktitle = {Developments in Language Theory - 27th International Conference, {DLT} 2023, Ume{\aa}, Sweden, June 12-16, 2023, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13911}, pages = {51--60}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-33264-7\_5}, doi = {10.1007/978-3-031-33264-7\_5}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dlt/BealC23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2302-06258, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin and Antonio Restivo and Wolfgang Steiner}, title = {Recognizability in S-adic shifts}, journal = {CoRR}, volume = {abs/2302.06258}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2302.06258}, doi = {10.48550/ARXIV.2302.06258}, eprinttype = {arXiv}, eprint = {2302.06258}, timestamp = {Mon, 20 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2302-06258.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealC22, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore}, title = {Checking whether a word is Hamming-isometric in linear time}, journal = {Theor. Comput. Sci.}, volume = {933}, pages = {55--59}, year = {2022}, url = {https://doi.org/10.1016/j.tcs.2022.08.032}, doi = {10.1016/J.TCS.2022.08.032}, timestamp = {Tue, 04 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BealC22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2208-03451, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore}, title = {Fast detection of specific fragments against a set of sequences}, journal = {CoRR}, volume = {abs/2208.03451}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2208.03451}, doi = {10.48550/ARXIV.2208.03451}, eprinttype = {arXiv}, eprint = {2208.03451}, timestamp = {Wed, 10 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2208-03451.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/ems/21/BealBEP21, author = {Marie{-}Pierre B{\'{e}}al and Jean Berstel and S{\o}ren Eilers and Dominique Perrin}, editor = {Jean{-}{\'{E}}ric Pin}, title = {Symbolic dynamics}, booktitle = {Handbook of Automata Theory}, pages = {987--1030}, publisher = {European Mathematical Society Publishing House, Z{\"{u}}rich, Switzerland}, year = {2021}, url = {https://doi.org/10.4171/Automata-2/5}, doi = {10.4171/AUTOMATA-2/5}, timestamp = {Mon, 11 Apr 2022 14:12:30 +0200}, biburl = {https://dblp.org/rec/books/ems/21/BealBEP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2103-01012, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin and Antonio Restivo}, title = {Unambiguously coded systems}, journal = {CoRR}, volume = {abs/2103.01012}, year = {2021}, url = {https://arxiv.org/abs/2103.01012}, eprinttype = {arXiv}, eprint = {2103.01012}, timestamp = {Thu, 04 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2103-01012.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-10541, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore}, title = {Checking whether a word is Hamming-isometric in linear time}, journal = {CoRR}, volume = {abs/2106.10541}, year = {2021}, url = {https://arxiv.org/abs/2106.10541}, eprinttype = {arXiv}, eprint = {2106.10541}, timestamp = {Tue, 29 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-10541.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2110-10267, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin and Antonio Restivo}, title = {Recognizability of morphisms}, journal = {CoRR}, volume = {abs/2110.10267}, year = {2021}, url = {https://arxiv.org/abs/2110.10267}, eprinttype = {arXiv}, eprint = {2110.10267}, timestamp = {Fri, 29 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2110-10267.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2112-14499, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin and Antonio Restivo}, title = {Decidable problems in substitution shifts}, journal = {CoRR}, volume = {abs/2112.14499}, year = {2021}, url = {https://arxiv.org/abs/2112.14499}, eprinttype = {arXiv}, eprint = {2112.14499}, timestamp = {Wed, 05 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2112-14499.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealH17, author = {Marie{-}Pierre B{\'{e}}al and Pavel Heller}, title = {Shifts of k-nested sequences}, journal = {Theor. Comput. Sci.}, volume = {658}, pages = {18--26}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.06.041}, doi = {10.1016/J.TCS.2016.06.041}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BealH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/BealH17, author = {Marie{-}Pierre B{\'{e}}al and Pavel Heller}, editor = {Pascal Weil}, title = {Generalized Dyck Shifts}, booktitle = {Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, {CSR} 2017, Kazan, Russia, June 8-12, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10304}, pages = {99--111}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-58747-9\_11}, doi = {10.1007/978-3-319-58747-9\_11}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/csr/BealH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealBD16, author = {Marie{-}Pierre B{\'{e}}al and Michel Blockelet and Catalin Dima}, title = {Sofic-Dyck shifts}, journal = {Theor. Comput. Sci.}, volume = {609}, pages = {226--244}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2015.09.027}, doi = {10.1016/J.TCS.2015.09.027}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BealBD16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dlt/BealH15, author = {Marie{-}Pierre B{\'{e}}al and Pavel Heller}, editor = {Igor Potapov}, title = {Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts}, booktitle = {Developments in Language Theory - 19th International Conference, {DLT} 2015, Liverpool, UK, July 27-30, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9168}, pages = {167--178}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-21500-6\_13}, doi = {10.1007/978-3-319-21500-6\_13}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/dlt/BealH15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BealP14, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, title = {A quadratic algorithm for road coloring}, journal = {Discret. Appl. Math.}, volume = {169}, pages = {15--29}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.12.002}, doi = {10.1016/J.DAM.2013.12.002}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BealP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/BealC14, author = {Marie{-}Pierre B{\'{e}}al and Olivier Carton}, title = {Preface}, journal = {Int. J. Found. Comput. Sci.}, volume = {25}, number = {8}, pages = {933--936}, year = {2014}, url = {https://doi.org/10.1142/S0129054114020031}, doi = {10.1142/S0129054114020031}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijfcs/BealC14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/AubrunB14, author = {Nathalie Aubrun and Marie{-}Pierre B{\'{e}}al}, title = {Tree algebra of sofic tree languages}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {48}, number = {4}, pages = {431--451}, year = {2014}, url = {https://doi.org/10.1051/ita/2014018}, doi = {10.1051/ITA/2014018}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/AubrunB14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ita/BealBD14, author = {Marie{-}Pierre B{\'{e}}al and Michel Blockelet and Catalin Dima}, title = {Zeta functions of finite-type-Dyck shifts are N-algebraic}, booktitle = {2014 Information Theory and Applications Workshop, {ITA} 2014, San Diego, CA, USA, February 9-14, 2014}, pages = {1--8}, publisher = {{IEEE}}, year = {2014}, url = {https://doi.org/10.1109/ITA.2014.6804286}, doi = {10.1109/ITA.2014.6804286}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ita/BealBD14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BealBD14, author = {Marie{-}Pierre B{\'{e}}al and Michel Blockelet and Catalin Dima}, editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and Martin Dietzfelbinger and Zolt{\'{a}}n {\'{E}}sik}, title = {Sofic-Dyck Shifts}, booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {8634}, pages = {63--74}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44522-8\_6}, doi = {10.1007/978-3-662-44522-8\_6}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BealBD14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/AubrunB13, author = {Nathalie Aubrun and Marie{-}Pierre B{\'{e}}al}, title = {Sofic Tree-Shifts}, journal = {Theory Comput. Syst.}, volume = {53}, number = {4}, pages = {621--644}, year = {2013}, url = {https://doi.org/10.1007/s00224-013-9456-1}, doi = {10.1007/S00224-013-9456-1}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/AubrunB13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/dlt/2013, editor = {Marie{-}Pierre B{\'{e}}al and Olivier Carton}, title = {Developments in Language Theory - 17th International Conference, {DLT} 2013, Marne-la-Vall{\'{e}}e, France, June 18-21, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7907}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38771-5}, doi = {10.1007/978-3-642-38771-5}, isbn = {978-3-642-38770-8}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dlt/2013.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BealBD13a, author = {Marie{-}Pierre B{\'{e}}al and Michel Blockelet and Catalin Dima}, title = {Sofic-Dyck shifts}, journal = {CoRR}, volume = {abs/1305.7413}, year = {2013}, url = {http://arxiv.org/abs/1305.7413}, eprinttype = {arXiv}, eprint = {1305.7413}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BealBD13a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BealBD13, author = {Marie{-}Pierre B{\'{e}}al and Michel Blockelet and Catalin Dima}, title = {Finite-type-Dyck shift spaces}, journal = {CoRR}, volume = {abs/1311.4223}, year = {2013}, url = {http://arxiv.org/abs/1311.4223}, eprinttype = {arXiv}, eprint = {1311.4223}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BealBD13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AubrunB12, author = {Nathalie Aubrun and Marie{-}Pierre B{\'{e}}al}, title = {Tree-shifts of finite type}, journal = {Theor. Comput. Sci.}, volume = {459}, pages = {16--25}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.07.020}, doi = {10.1016/J.TCS.2012.07.020}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AubrunB12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dlt/BealCDJL12, author = {Marie{-}Pierre B{\'{e}}al and Jean{-}Marc Champarnaud and Jean{-}Philippe Dubernard and Hadrien Jeanne and Sylvain Lombardy}, editor = {Hsu{-}Chun Yen and Oscar H. Ibarra}, title = {Decidability of Geometricity of Regular Languages}, booktitle = {Developments in Language Theory - 16th International Conference, {DLT} 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7410}, pages = {62--72}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-31653-1\_7}, doi = {10.1007/978-3-642-31653-1\_7}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/dlt/BealCDJL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/formats/AsarinBBDP12, author = {Eugene Asarin and Nicolas Basset and Marie{-}Pierre B{\'{e}}al and Aldric Degorre and Dominique Perrin}, editor = {Marcin Jurdzinski and Dejan Nickovic}, title = {Toward a Timed Theory of Channel Coding}, booktitle = {Formal Modeling and Analysis of Timed Systems - 10th International Conference, {FORMATS} 2012, London, UK, September 18-20, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7595}, pages = {27--42}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33365-1\_4}, doi = {10.1007/978-3-642-33365-1\_4}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/formats/AsarinBBDP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/BealBP11, author = {Marie{-}Pierre B{\'{e}}al and Mikhail V. Berlinkov and Dominique Perrin}, title = {A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata}, journal = {Int. J. Found. Comput. Sci.}, volume = {22}, number = {2}, pages = {277--288}, year = {2011}, url = {https://doi.org/10.1142/S0129054111008039}, doi = {10.1142/S0129054111008039}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ijfcs/BealBP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/BealCMS11, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore and Bruce E. Moision and Paul H. Siegel}, title = {Periodic-Finite-Type Shift Spaces}, journal = {{IEEE} Trans. Inf. Theory}, volume = {57}, number = {6}, pages = {3677--3691}, year = {2011}, url = {https://doi.org/10.1109/TIT.2011.2143910}, doi = {10.1109/TIT.2011.2143910}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/BealCMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/AubrunB10, author = {Nathalie Aubrun and Marie{-}Pierre B{\'{e}}al}, editor = {Farid M. Ablayev and Ernst W. Mayr}, title = {Sofic and Almost of Finite Type Tree-Shifts}, booktitle = {Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, {CSR} 2010, Kazan, Russia, June 16-20, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6072}, pages = {12--24}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13182-0\_2}, doi = {10.1007/978-3-642-13182-0\_2}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/csr/AubrunB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1006-1265, author = {Marie{-}Pierre B{\'{e}}al and Jean Berstel and S{\o}ren Eilers and Dominique Perrin}, title = {Symbolic dynamics}, journal = {CoRR}, volume = {abs/1006.1265}, year = {2010}, url = {http://arxiv.org/abs/1006.1265}, eprinttype = {arXiv}, eprint = {1006.1265}, timestamp = {Thu, 09 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1006-1265.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijac/BealBR09, author = {Marie{-}Pierre B{\'{e}}al and Fabio Burderi and Antonio Restivo}, title = {Coding Partitions of Regular Sets}, journal = {Int. J. Algebra Comput.}, volume = {19}, number = {8}, pages = {1011--1023}, year = {2009}, url = {https://doi.org/10.1142/S0218196709005457}, doi = {10.1142/S0218196709005457}, timestamp = {Tue, 25 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijac/BealBR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealP09, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, title = {Completing codes in a sofic shift}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {43}, pages = {4423--4431}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2009.07.023}, doi = {10.1016/J.TCS.2009.07.023}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BealP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dlt/BealP09, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, editor = {Volker Diekert and Dirk Nowotka}, title = {A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata}, booktitle = {Developments in Language Theory, 13th International Conference, {DLT} 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5583}, pages = {81--90}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02737-6\_6}, doi = {10.1007/978-3-642-02737-6\_6}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/dlt/BealP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AubrunB09, author = {Nathalie Aubrun and Marie{-}Pierre B{\'{e}}al}, editor = {Susanne Albers and Alberto Marchetti{-}Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas}, title = {Decidability of Conjugacy of Tree-Shifts of Finite Type}, booktitle = {Automata, Languages and Programming, 36th International Colloquium, {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {5555}, pages = {132--143}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02927-1\_13}, doi = {10.1007/978-3-642-02927-1\_13}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AubrunB09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mics/BealCKP08, author = {Marie{-}Pierre B{\'{e}}al and Eugen Czeizler and Jarkko Kari and Dominique Perrin}, title = {Unambiguous Automata}, journal = {Math. Comput. Sci.}, volume = {1}, number = {4}, pages = {625--638}, year = {2008}, url = {https://doi.org/10.1007/s11786-007-0027-1}, doi = {10.1007/S11786-007-0027-1}, timestamp = {Wed, 12 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mics/BealCKP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/BealLP08, author = {Marie{-}Pierre B{\'{e}}al and Sylvain Lombardy and Dominique Perrin}, editor = {Frank R. Kschischang and En{-}Hui Yang}, title = {Embeddings of local automata}, booktitle = {2008 {IEEE} International Symposium on Information Theory, {ISIT} 2008, Toronto, ON, Canada, July 6-11, 2008}, pages = {2351--2355}, publisher = {{IEEE}}, year = {2008}, url = {https://doi.org/10.1109/ISIT.2008.4595411}, doi = {10.1109/ISIT.2008.4595411}, timestamp = {Wed, 16 Oct 2019 14:14:48 +0200}, biburl = {https://dblp.org/rec/conf/isit/BealLP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0803-0726, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, title = {A quadratic algorithm for road coloring}, journal = {CoRR}, volume = {abs/0803.0726}, year = {2008}, url = {http://arxiv.org/abs/0803.0726}, eprinttype = {arXiv}, eprint = {0803.0726}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0803-0726.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dlt/BealBR07, author = {Marie{-}Pierre B{\'{e}}al and Fabio Burderi and Antonio Restivo}, editor = {Tero Harju and Juhani Karhum{\"{a}}ki and Arto Lepist{\"{o}}}, title = {Coding Partitions: Regularity, Maximality and Global Ambiguity}, booktitle = {Developments in Language Theory, 11th International Conference, {DLT} 2007, Turku, Finland, July 3-6, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4588}, pages = {48--59}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-73208-2\_8}, doi = {10.1007/978-3-540-73208-2\_8}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/dlt/BealBR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/BealC07, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore}, title = {Minimizing local automata}, booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2007, Nice, France, June 24-29, 2007}, pages = {1376--1380}, publisher = {{IEEE}}, year = {2007}, url = {https://doi.org/10.1109/ISIT.2007.4557131}, doi = {10.1109/ISIT.2007.4557131}, timestamp = {Wed, 16 Oct 2019 14:14:48 +0200}, biburl = {https://dblp.org/rec/conf/isit/BealC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijac/BealFP06, author = {Marie{-}Pierre B{\'{e}}al and Francesca Fiorenzi and Dominique Perrin}, title = {The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence}, journal = {Int. J. Algebra Comput.}, volume = {16}, number = {3}, pages = {443--460}, year = {2006}, url = {https://doi.org/10.1142/S0218196706003050}, doi = {10.1142/S0218196706003050}, timestamp = {Tue, 25 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijac/BealFP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealP06, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, title = {Codes, unambiguous automata and sofic systems}, journal = {Theor. Comput. Sci.}, volume = {356}, number = {1-2}, pages = {6--13}, year = {2006}, url = {https://doi.org/10.1016/j.tcs.2006.01.043}, doi = {10.1016/J.TCS.2006.01.043}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BealP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/BealLS06, author = {Marie{-}Pierre B{\'{e}}al and Sylvain Lombardy and Jacques Sakarovitch}, editor = {Dima Grigoriev and John Harrison and Edward A. Hirsch}, title = {Conjugacy and Equivalence of Weighted Automata and Functional Transducers}, booktitle = {Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, {CSR} 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3967}, pages = {58--69}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11753728\_9}, doi = {10.1007/11753728\_9}, timestamp = {Tue, 29 Nov 2022 13:36:56 +0100}, biburl = {https://dblp.org/rec/conf/csr/BealLS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BealP06, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Complete Codes in a Sofic Shift}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {127--136}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_9}, doi = {10.1007/11672142\_9}, timestamp = {Wed, 19 May 2021 12:05:43 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BealP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijac/BealFM05, author = {Marie{-}Pierre B{\'{e}}al and Francesca Fiorenzi and Filippo Mignosi}, title = {Minimal Forbidden Patterns of Multi-Dimensional Shifts}, journal = {Int. J. Algebra Comput.}, volume = {15}, number = {1}, pages = {73--93}, year = {2005}, url = {https://doi.org/10.1142/S0218196705002165}, doi = {10.1142/S0218196705002165}, timestamp = {Tue, 25 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijac/BealFM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealP05, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, title = {Codes and sofic constraints}, journal = {Theor. Comput. Sci.}, volume = {340}, number = {1}, pages = {381--393}, year = {2005}, url = {https://doi.org/10.1016/j.tcs.2005.03.033}, doi = {10.1016/J.TCS.2005.03.033}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BealP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealFP05, author = {Marie{-}Pierre B{\'{e}}al and Francesca Fiorenzi and Dominique Perrin}, title = {A hierarchy of shift equivalent sofic shifts}, journal = {Theor. Comput. Sci.}, volume = {345}, number = {2-3}, pages = {190--205}, year = {2005}, url = {https://doi.org/10.1016/j.tcs.2005.07.007}, doi = {10.1016/J.TCS.2005.07.007}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BealFP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/BealCF05, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore and Gabriele Fici}, title = {Presentations of constrained systems with unconstrained positions}, journal = {{IEEE} Trans. Inf. Theory}, volume = {51}, number = {5}, pages = {1891--1900}, year = {2005}, url = {https://doi.org/10.1109/TIT.2005.846423}, doi = {10.1109/TIT.2005.846423}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/BealCF05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BealLS05, author = {Marie{-}Pierre B{\'{e}}al and Sylvain Lombardy and Jacques Sakarovitch}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {On the Equivalence of -Automata}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {397--409}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_33}, doi = {10.1007/11523468\_33}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BealLS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BealC04, author = {Marie{-}Pierre B{\'{e}}al and Olivier Carton}, title = {Determinization of Transducers over Infinite Words: The General Case}, journal = {Theory Comput. Syst.}, volume = {37}, number = {4}, pages = {483--502}, year = {2004}, url = {https://doi.org/10.1007/s00224-003-1014-9}, doi = {10.1007/S00224-003-1014-9}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BealC04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealBCR04, author = {Marie{-}Pierre B{\'{e}}al and Anne Bergeron and Sylvie Corteel and Mathieu Raffinot}, title = {An algorithmic view of gene teams}, journal = {Theor. Comput. Sci.}, volume = {320}, number = {2-3}, pages = {395--418}, year = {2004}, url = {https://doi.org/10.1016/j.tcs.2004.02.036}, doi = {10.1016/J.TCS.2004.02.036}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BealBCR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BealFP04, author = {Marie{-}Pierre B{\'{e}}al and Francesca Fiorenzi and Dominique Perrin}, editor = {Jir{\'{\i}} Fiala and V{\'{a}}clav Koubek and Jan Kratochv{\'{\i}}l}, title = {A Hierarchy of Irreducible Sofic Shifts}, booktitle = {Mathematical Foundations of Computer Science 2004, 29th International Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3153}, pages = {611--622}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-28629-5\_47}, doi = {10.1007/978-3-540-28629-5\_47}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BealFP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BealFP04, author = {Marie{-}Pierre B{\'{e}}al and Francesca Fiorenzi and Dominique Perrin}, editor = {Volker Diekert and Michel Habib}, title = {The Syntactic Graph of a Sofic Shift}, booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2996}, pages = {282--293}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-24749-4\_25}, doi = {10.1007/978-3-540-24749-4\_25}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BealFP04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fuin/BealCM03, author = {Marie{-}Pierre B{\'{e}}al and Maxime Crochemore and Filippo Mignosi and Antonio Restivo and Marinella Sciortino}, title = {Computing forbidden words of regular languages}, journal = {Fundam. Informaticae}, volume = {56}, number = {1-2}, pages = {121--135}, year = {2003}, url = {http://content.iospress.com/articles/fundamenta-informaticae/fi56-1-2-08}, timestamp = {Fri, 18 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fuin/BealCM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/BealP03, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, title = {On the generating sequences of regular languages on \emph{k} symbols}, journal = {J. {ACM}}, volume = {50}, number = {6}, pages = {955--980}, year = {2003}, url = {https://doi.org/10.1145/950620.950625}, doi = {10.1145/950620.950625}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/BealP03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealCPS03, author = {Marie{-}Pierre B{\'{e}}al and Olivier Carton and Christophe Prieur and Jacques Sakarovitch}, title = {Squaring transducers: an efficient procedure for deciding functionality and sequentiality}, journal = {Theor. Comput. Sci.}, volume = {292}, number = {1}, pages = {45--63}, year = {2003}, url = {https://doi.org/10.1016/S0304-3975(01)00214-6}, doi = {10.1016/S0304-3975(01)00214-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BealCPS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Beal03, author = {Marie{-}Pierre B{\'{e}}al}, title = {Extensions of the method of poles for code construction}, journal = {{IEEE} Trans. Inf. Theory}, volume = {49}, number = {6}, pages = {1516--1523}, year = {2003}, url = {https://doi.org/10.1109/TIT.2003.811920}, doi = {10.1109/TIT.2003.811920}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/Beal03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aam/BealP02, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, title = {A weak equivalence between shifts of finite type}, journal = {Adv. Appl. Math.}, volume = {29}, number = {2}, pages = {162--171}, year = {2002}, url = {https://doi.org/10.1016/S0196-8858(02)00004-0}, doi = {10.1016/S0196-8858(02)00004-0}, timestamp = {Wed, 07 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aam/BealP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealC02, author = {Marie{-}Pierre B{\'{e}}al and Olivier Carton}, title = {Determinization of transducers over finite and infinite words}, journal = {Theor. Comput. Sci.}, volume = {289}, number = {1}, pages = {225--251}, year = {2002}, url = {https://doi.org/10.1016/S0304-3975(01)00271-7}, doi = {10.1016/S0304-3975(01)00271-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BealC02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BealP02, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, editor = {Helmut Alt and Afonso Ferreira}, title = {On the Enumerative Sequences of Regular Languages on k Symbols}, booktitle = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2285}, pages = {547--558}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45841-7\_45}, doi = {10.1007/3-540-45841-7\_45}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BealP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aam/BealMRS00, author = {Marie{-}Pierre B{\'{e}}al and Filippo Mignosi and Antonio Restivo and Marinella Sciortino}, title = {Forbidden Words in Symbolic Dynamics}, journal = {Adv. Appl. Math.}, volume = {25}, number = {2}, pages = {163--193}, year = {2000}, url = {https://doi.org/10.1006/aama.2000.0682}, doi = {10.1006/AAMA.2000.0682}, timestamp = {Fri, 30 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aam/BealMRS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/BealC00, author = {Marie{-}Pierre B{\'{e}}al and Olivier Carton}, title = {Asynchronous sliding block maps}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {34}, number = {2}, pages = {139--156}, year = {2000}, url = {https://doi.org/10.1051/ita:2000111}, doi = {10.1051/ITA:2000111}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/BealC00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/BealC00a, author = {Marie{-}Pierre B{\'{e}}al and Olivier Carton}, title = {Computing the prefix of an automaton}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {34}, number = {6}, pages = {503--514}, year = {2000}, url = {https://doi.org/10.1051/ita:2000127}, doi = {10.1051/ITA:2000127}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/BealC00a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BassinoBP00, author = {Fr{\'{e}}d{\'{e}}rique Bassino and Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, title = {A Finite State Version of the Kraft--McMillan Theorem}, journal = {{SIAM} J. Comput.}, volume = {30}, number = {4}, pages = {1211--1230}, year = {2000}, url = {https://doi.org/10.1137/S0097539798343908}, doi = {10.1137/S0097539798343908}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BassinoBP00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BealC00, author = {Marie{-}Pierre B{\'{e}}al and Olivier Carton}, editor = {Ugo Montanari and Jos{\'{e}} D. P. Rolim and Emo Welzl}, title = {Determinization of Transducers over Infinite Words}, booktitle = {Automata, Languages and Programming, 27th International Colloquium, {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1853}, pages = {561--570}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-45022-X\_47}, doi = {10.1007/3-540-45022-X\_47}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BealC00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/BealCPS00, author = {Marie{-}Pierre B{\'{e}}al and Olivier Carton and Christophe Prieur and Jacques Sakarovitch}, editor = {Gaston H. Gonnet and Daniel Panario and Alfredo Viola}, title = {Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers}, booktitle = {{LATIN} 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1776}, pages = {397--406}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/10719839\_39}, doi = {10.1007/10719839\_39}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/BealCPS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BassinoBP99, author = {Fr{\'{e}}d{\'{e}}rique Bassino and Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, title = {Enumerative Sequences of Leaves and Nodes in Rational Trees}, journal = {Theor. Comput. Sci.}, volume = {221}, number = {1-2}, pages = {41--60}, year = {1999}, url = {https://doi.org/10.1016/S0304-3975(99)00026-2}, doi = {10.1016/S0304-3975(99)00026-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BassinoBP99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dlt/BealC99, author = {Marie{-}Pierre B{\'{e}}al and Olivier Carton}, editor = {Grzegorz Rozenberg and Wolfgang Thomas}, title = {Asynchronous sliding block maps}, booktitle = {Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999}, pages = {47--59}, publisher = {World Scientific}, year = {1999}, url = {https://doi.org/10.1142/9789812792464\_0005}, doi = {10.1142/9789812792464\_0005}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dlt/BealC99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BealS98, author = {Marie{-}Pierre B{\'{e}}al and Jean Senellart}, title = {On the Bound of the Synchronization Delay of a Local Automaton}, journal = {Theor. Comput. Sci.}, volume = {205}, number = {1-2}, pages = {297--306}, year = {1998}, url = {https://doi.org/10.1016/S0304-3975(98)80011-X}, doi = {10.1016/S0304-3975(98)80011-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BealS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/BassinoBP98, author = {Fr{\'{e}}d{\'{e}}rique Bassino and Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, editor = {Claudio L. Lucchesi and Arnaldo V. Moura}, title = {Super-State Automata and Rational Trees}, booktitle = {{LATIN} '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1380}, pages = {42--52}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/BFb0054309}, doi = {10.1007/BFB0054309}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/BassinoBP98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BassinoBP97, author = {Fr{\'{e}}d{\'{e}}rique Bassino and Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti{-}Spaccamela}, title = {Enumerative Sequences of Leaves in Rational Trees}, booktitle = {Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1256}, pages = {76--86}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-63165-8\_166}, doi = {10.1007/3-540-63165-8\_166}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BassinoBP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/hfl/BealP97, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, editor = {Grzegorz Rozenberg and Arto Salomaa}, title = {Symbolic Dynamics and Finite Automata}, booktitle = {Handbook of Formal Languages, Volume 2. Linear Modeling: Background and Application}, pages = {463--506}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/978-3-662-07675-0\_10}, doi = {10.1007/978-3-662-07675-0\_10}, timestamp = {Sun, 25 Nov 2018 14:05:59 +0100}, biburl = {https://dblp.org/rec/reference/hfl/BealP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BealCR96, author = {Marie{-}Pierre B{\'{e}}al and Olivier Carton and Christophe Reutenauer}, editor = {Claude Puech and R{\"{u}}diger Reischuk}, title = {Cyclic Languages and Strongly Cyclic Languages}, booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1046}, pages = {49--59}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-60922-9\_5}, doi = {10.1007/3-540-60922-9\_5}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BealCR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BealMR96, author = {Marie{-}Pierre B{\'{e}}al and Filippo Mignosi and Antonio Restivo}, editor = {Claude Puech and R{\"{u}}diger Reischuk}, title = {Minimal Forbidden Words and Symbolic Dynamics}, booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1046}, pages = {555--566}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-60922-9\_45}, doi = {10.1007/3-540-60922-9\_45}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BealMR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Beal95, author = {Marie{-}Pierre B{\'{e}}al}, title = {Puissance ext{\'{e}}rieure d'un automate d{\'{e}}terministe, application au calcul de la fonction z{\^{e}}ta d'un syst{\`{e}}me sofique}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {29}, number = {2}, pages = {85--103}, year = {1995}, url = {https://doi.org/10.1051/ita/1995290200851}, doi = {10.1051/ITA/1995290200851}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Beal95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/AshleyB94, author = {Jonathan J. Ashley and Marie{-}Pierre B{\'{e}}al}, title = {A note on the method of poles for code construction}, journal = {{IEEE} Trans. Inf. Theory}, volume = {40}, number = {2}, pages = {512--517}, year = {1994}, url = {https://doi.org/10.1109/18.312177}, doi = {10.1109/18.312177}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/AshleyB94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Beal90, author = {Marie{-}Pierre B{\'{e}}al}, title = {The method of poles: {A} coding method for constrained channels}, journal = {{IEEE} Trans. Inf. Theory}, volume = {36}, number = {4}, pages = {763--772}, year = {1990}, url = {https://doi.org/10.1109/18.53736}, doi = {10.1109/18.53736}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/Beal90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Beal88, author = {Marie{-}Pierre B{\'{e}}al}, title = {Codes Circulaires, Automates Locaux et Entropie}, journal = {Theor. Comput. Sci.}, volume = {57}, pages = {283--302}, year = {1988}, url = {https://doi.org/10.1016/0304-3975(88)90043-6}, doi = {10.1016/0304-3975(88)90043-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Beal88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.