Provider: Schloss Dagstuhl - Leibniz Center for Informatics
Database: dblp computer science bibliography
Content:text/plain; charset="utf-8"
TY - CHAP
ID - DBLP:books/ems/21/BerstelBCF21
AU - Berstel, Jean
AU - Boasson, Luc
AU - Carton, Olivier
AU - Fagnot, Isabelle
TI - Minimisation of automata.
BT - Handbook of Automata Theory.
SP - 337
EP - 373
PY - 2021//
DO - 10.4171/AUTOMATA-1/10
UR - https://doi.org/10.4171/Automata-1/10
ER -
TY - CHAP
ID - DBLP:books/ems/21/BealBEP21
AU - Béal, Marie-Pierre
AU - Berstel, Jean
AU - Eilers, Søren
AU - Perrin, Dominique
TI - Symbolic dynamics.
BT - Handbook of Automata Theory.
SP - 987
EP - 1030
PY - 2021//
DO - 10.4171/AUTOMATA-2/5
UR - https://doi.org/10.4171/Automata-2/5
ER -
TY - JOUR
ID - DBLP:journals/ijac/Berstel13
AU - Berstel, Jean
TI - Lettre à Christophe Reutenauer.
JO - Int. J. Algebra Comput.
VL - 23
IS - 4
PY - 2013//
DO - 10.1142/S0218196713020013
UR - https://doi.org/10.1142/S0218196713020013
ER -
TY - JOUR
ID - DBLP:journals/ejc/BerstelFPRR12
AU - Berstel, Jean
AU - Felice, Clelia de
AU - Perrin, Dominique
AU - Reutenauer, Christophe
AU - Rindone, Giuseppina
TI - Recent results on syntactic groups of prefix codes.
JO - Eur. J. Comb.
VL - 33
IS - 7
SP - 1386
EP - 1401
PY - 2012//
DO - 10.1016/J.EJC.2012.03.004
UR - https://doi.org/10.1016/j.ejc.2012.03.004
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelBF12
AU - Berstel, Jean
AU - Boasson, Luc
AU - Fagnot, Isabelle
TI - Splicing systems and the Chomsky hierarchy.
JO - Theor. Comput. Sci.
VL - 436
SP - 2
EP - 22
PY - 2012//
DO - 10.1016/J.TCS.2012.03.008
UR - https://doi.org/10.1016/j.tcs.2012.03.008
ER -
TY - Informal or Other Publication
ID - DBLP:journals/corr/abs-1102-0947
AU - Berstel, Jean
AU - Boasson, Luc
AU - Fagnot, Isabelle
TI - Splicing systems and the Chomsky hierarchy
JO - CoRR
VL - abs/1102.0947
PY - 2011//
UR - http://arxiv.org/abs/1102.0947
ER -
TY - BOOK
ID - DBLP:books/daglib/0025093
AU - Berstel, Jean
AU - Perrin, Dominique
AU - Reutenauer, Christophe
TI - Codes and Automata.
T3 - Encyclopedia of mathematics and its applications
VL - 129
SP - I
EP - XIII
SP - 1
EP - 619
PY - 2010//
PB - Cambridge University Press
SN - ISBN 978-0-521-88831-8
ER -
TY - JOUR
ID - DBLP:journals/iandc/BerstelBCPR10
AU - Berstel, Jean
AU - Boasson, Luc
AU - Carton, Olivier
AU - Pin, Jean-Eric
AU - Restivo, Antonio
TI - The expressive power of the shuffle product.
JO - Inf. Comput.
VL - 208
IS - 11
SP - 1258
EP - 1272
PY - 2010//
DO - 10.1016/J.IC.2010.06.002
UR - https://doi.org/10.1016/j.ic.2010.06.002
ER -
TY - JOUR
ID - DBLP:journals/mst/BerstelBCF10
AU - Berstel, Jean
AU - Boasson, Luc
AU - Carton, Olivier
AU - Fagnot, Isabelle
TI - Sturmian Trees.
JO - Theory Comput. Syst.
VL - 46
IS - 3
SP - 443
EP - 478
PY - 2010//
DO - 10.1007/S00224-009-9228-0
UR - https://doi.org/10.1007/s00224-009-9228-0
ER -
TY - Informal or Other Publication
ID - DBLP:journals/corr/abs-1006-1265
AU - Béal, Marie-Pierre
AU - Berstel, Jean
AU - Eilers, Søren
AU - Perrin, Dominique
TI - Symbolic dynamics
JO - CoRR
VL - abs/1006.1265
PY - 2010//
UR - http://arxiv.org/abs/1006.1265
ER -
TY - Informal or Other Publication
ID - DBLP:journals/corr/abs-1010-5318
AU - Berstel, Jean
AU - Boasson, Luc
AU - Carton, Olivier
AU - Fagnot, Isabelle
TI - Minimization of Automata
JO - CoRR
VL - abs/1010.5318
PY - 2010//
UR - http://arxiv.org/abs/1010.5318
ER -
TY - Informal or Other Publication
ID - DBLP:journals/corr/abs-1011-5369
AU - Berstel, Jean
AU - Felice, Clelia de
AU - Perrin, Dominique
AU - Reutenauer, Christophe
AU - Rindone, Giuseppina
TI - Bifix codes and Sturmian words
JO - CoRR
VL - abs/1011.5369
PY - 2010//
UR - http://arxiv.org/abs/1011.5369
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelBC09
AU - Berstel, Jean
AU - Boasson, Luc
AU - Carton, Olivier
TI - Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm.
JO - Theor. Comput. Sci.
VL - 410
IS - 30-32
SP - 2811
EP - 2822
PY - 2009//
DO - 10.1016/J.TCS.2009.01.039
UR - https://doi.org/10.1016/j.tcs.2009.01.039
ER -
TY - Informal or Other Publication
ID - DBLP:journals/corr/abs-0903-2382
AU - Berstel, Jean
AU - Boasson, Luc
AU - Carton, Olivier
AU - Fagnot, Isabelle
TI - Infinite words without palindrome
JO - CoRR
VL - abs/0903.2382
PY - 2009//
UR - http://arxiv.org/abs/0903.2382
ER -
TY - JOUR
ID - DBLP:journals/ita/BerstelHK08
AU - Berstel, Jean
AU - Harju, Tero
AU - Karhumäki, Juhani
TI - Preface.
JO - RAIRO Theor. Informatics Appl.
VL - 42
IS - 4
SP - 657
PY - 2008//
DO - 10.1051/ITA:2008001
UR - https://doi.org/10.1051/ita:2008001
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelR08
AU - Berstel, Jean
AU - Reutenauer, Christophe
TI - Another proof of Soittola's theorem.
JO - Theor. Comput. Sci.
VL - 393
IS - 1-3
SP - 196
EP - 203
PY - 2008//
DO - 10.1016/J.TCS.2007.11.020
UR - https://doi.org/10.1016/j.tcs.2007.11.020
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelR08a
AU - Berstel, Jean
AU - Reutenauer, Christophe
TI - Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids.
JO - Theor. Comput. Sci.
VL - 400
IS - 1-3
SP - 144
EP - 158
PY - 2008//
DO - 10.1016/J.TCS.2008.02.051
UR - https://doi.org/10.1016/j.tcs.2008.02.051
ER -
TY - JOUR
ID - DBLP:journals/ejc/BerstelP07
AU - Berstel, Jean
AU - Perrin, Dominique
TI - The origins of combinatorics on words.
JO - Eur. J. Comb.
VL - 28
IS - 3
SP - 996
EP - 1022
PY - 2007//
DO - 10.1016/J.EJC.2005.07.019
UR - https://doi.org/10.1016/j.ejc.2005.07.019
UR - https://www.wikidata.org/entity/Q55951859
ER -
TY - CPAPER
ID - DBLP:conf/cai/Berstel07
AU - Berstel, Jean
TI - Sturmian and Episturmian Words.
BT - Algebraic Informatics, Second International Conference, CAI 2007, Thessaloniki, Greece, May 21-25, 2007, Revised Selected and Invited Papers
SP - 23
EP - 47
PY - 2007//
DO - 10.1007/978-3-540-75414-5_2
UR - https://doi.org/10.1007/978-3-540-75414-5_2
ER -
TY - CPAPER
ID - DBLP:conf/stacs/BerstelBCF07
AU - Berstel, Jean
AU - Boasson, Luc
AU - Carton, Olivier
AU - Fagnot, Isabelle
TI - A First Investigation of Sturmian Trees.
BT - STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings
SP - 73
EP - 84
PY - 2007//
DO - 10.1007/978-3-540-70918-3_7
UR - https://doi.org/10.1007/978-3-540-70918-3_7
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelBCPP06
AU - Berstel, Jean
AU - Boasson, Luc
AU - Carton, Olivier
AU - Petazzoni, Bruno
AU - Pin, Jean-Eric
TI - Operations preserving regular languages.
JO - Theor. Comput. Sci.
VL - 354
IS - 3
SP - 405
EP - 420
PY - 2006//
DO - 10.1016/J.TCS.2005.11.034
UR - https://doi.org/10.1016/j.tcs.2005.11.034
ER -
TY - CPAPER
ID - DBLP:conf/mfcs/BerstelS06
AU - Berstel, Jean
AU - Savelli, Alessandra
TI - Crochemore Factorization of Sturmian and Other Infinite Words.
BT - Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings
SP - 157
EP - 166
PY - 2006//
DO - 10.1007/11821069_14
UR - https://doi.org/10.1007/11821069_14
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelBL05
AU - Berstel, Jean
AU - Boasson, Luc
AU - Latteux, Michel
TI - Mixed languages.
JO - Theor. Comput. Sci.
VL - 332
IS - 1-3
SP - 179
EP - 198
PY - 2005//
DO - 10.1016/J.TCS.2004.08.016
UR - https://doi.org/10.1016/j.tcs.2004.08.016
ER -
TY - JOUR
ID - DBLP:journals/tcs/Berstel05
AU - Berstel, Jean
TI - Growth of repetition-free words -- a review.
JO - Theor. Comput. Sci.
VL - 340
IS - 1
SP - 280
EP - 290
PY - 2005//
DO - 10.1016/J.TCS.2005.03.039
UR - https://doi.org/10.1016/j.tcs.2005.03.039
ER -
TY - JOUR
ID - DBLP:journals/tosem/BerstelCRP05
AU - Berstel, Jean
AU - Crespi-Reghizzi, Stefano
AU - Roussel, Gilles
AU - Pietro, Pierluigi San
TI - A scalable formal method for design and automatic checking of user interfaces.
JO - ACM Trans. Softw. Eng. Methodol.
VL - 14
IS - 2
SP - 124
EP - 167
PY - 2005//
DO - 10.1145/1061254.1061256
UR - https://doi.org/10.1145/1061254.1061256
ER -
TY - JOUR
ID - DBLP:journals/sigact/Berstel04
AU - Berstel, Jean
TI - Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press.
JO - SIGACT News
VL - 35
IS - 1
SP - 12
EP - 16
PY - 2004//
DO - 10.1145/970831.970838
UR - https://doi.org/10.1145/970831.970838
ER -
TY - CPAPER
ID - DBLP:conf/wia/BerstelC04
AU - Berstel, Jean
AU - Carton, Olivier
TI - On the Complexity of Hopcroft's State Minimization Algorithm.
BT - Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers
SP - 35
EP - 44
PY - 2004//
DO - 10.1007/978-3-540-30500-2_4
UR - https://doi.org/10.1007/978-3-540-30500-2_4
ER -
TY - JOUR
ID - DBLP:journals/eatcs/BerstelK03
AU - Berstel, Jean
AU - Karhumäki, Juhani
TI - Combinatorics on words: a tutorial.
JO - Bull. EATCS
VL - 79
SP - 178
EP -
PY - 2003//
ER -
TY - CPAPER
ID - DBLP:conf/fct/BerstelBCPP03
AU - Berstel, Jean
AU - Boasson, Luc
AU - Carton, Olivier
AU - Petazzoni, Bruno
AU - Pin, Jean-Eric
TI - Operations Preserving Recognizable Languages.
BT - Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings
SP - 343
EP - 354
PY - 2003//
DO - 10.1007/978-3-540-45077-1_32
UR - https://doi.org/10.1007/978-3-540-45077-1_32
ER -
TY - JOUR
ID - DBLP:journals/acta/BerstelB02
AU - Berstel, Jean
AU - Boasson, Luc
TI - Formal properties of XML grammars and languages.
JO - Acta Informatica
VL - 38
IS - 9
SP - 649
EP - 671
PY - 2002//
DO - 10.1007/S00236-002-0085-4
UR - https://doi.org/10.1007/s00236-002-0085-4
ER -
TY - JOUR
ID - DBLP:journals/ijac/Berstel02
AU - Berstel, Jean
TI - Recent Results on Extensions of Sturmian Words.
JO - Int. J. Algebra Comput.
VL - 12
IS - 1-2
SP - 371
EP - 385
PY - 2002//
DO - 10.1142/S021819670200095X
UR - https://doi.org/10.1142/S021819670200095X
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelB02
AU - Berstel, Jean
AU - Boasson, Luc
TI - Shuffle factorization is unique.
JO - Theor. Comput. Sci.
VL - 273
IS - 1-2
SP - 47
EP - 67
PY - 2002//
DO - 10.1016/S0304-3975(00)00433-3
UR - https://doi.org/10.1016/S0304-3975(00)00433-3
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelV02
AU - Berstel, Jean
AU - Vuillon, Laurent
TI - Coding rotations on intervals.
JO - Theor. Comput. Sci.
VL - 281
IS - 1-2
SP - 99
EP - 107
PY - 2002//
DO - 10.1016/S0304-3975(02)00009-9
UR - https://doi.org/10.1016/S0304-3975(02)00009-9
ER -
TY - CPAPER
ID - DBLP:conf/birthday/BerstelB02
AU - Berstel, Jean
AU - Boasson, Luc
TI - Balanced Grammars and Their Languages.
BT - Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
SP - 3
EP - 25
PY - 2002//
DO - 10.1007/3-540-45711-9_1
UR - https://doi.org/10.1007/3-540-45711-9_1
ER -
TY - JOUR
ID - DBLP:journals/ita/Berstel01
AU - Berstel, Jean
TI - An Exercise on Fibonacci Representations.
JO - RAIRO Theor. Informatics Appl.
VL - 35
IS - 6
SP - 491
EP - 498
PY - 2001//
DO - 10.1051/ITA:2001127
UR - https://doi.org/10.1051/ita:2001127
ER -
TY - CPAPER
ID - DBLP:conf/icse/BerstelCRP01
AU - Berstel, Jean
AU - Crespi-Reghizzi, Stefano
AU - Roussel, Gilles
AU - Pietro, Pierluigi San
TI - A Scalable Formal Method for Design and Automatic Checking of User Interfaces.
BT - Proceedings of the 23rd International Conference on Software Engineering, ICSE 2001, 12-19 May 2001, Toronto, Ontario, Canada
SP - 453
EP - 462
PY - 2001//
DO - 10.1109/ICSE.2001.919118
UR - https://doi.org/10.1109/ICSE.2001.919118
UR - https://doi.ieeecomputersociety.org/10.1109/ICSE.2001.919118
ER -
TY - CPAPER
ID - DBLP:conf/mfcs/BerstelB00
AU - Berstel, Jean
AU - Boasson, Luc
TI - XML Grammars.
BT - Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings
SP - 182
EP - 191
PY - 2000//
DO - 10.1007/3-540-44612-5_14
UR - https://doi.org/10.1007/3-540-44612-5_14
ER -
TY - Informal or Other Publication
ID - DBLP:journals/corr/cs-DM-0011011
AU - Berstel, Jean
AU - Boasson, Luc
TI - Formal Properties of XML Grammars and Languages
JO - CoRR
VL - cs.DM/0011011
PY - 2000//
UR - https://arxiv.org/abs/cs/0011011
ER -
TY - JOUR
ID - DBLP:journals/ijac/BerstelB99
AU - Berstel, Jean
AU - Boasson, Luc
TI - A Note on List Languages.
JO - Int. J. Algebra Comput.
VL - 9
IS - 3-4
SP - 263
EP - 270
PY - 1999//
DO - 10.1142/S0218196799000175
UR - https://doi.org/10.1142/S0218196799000175
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelB99
AU - Berstel, Jean
AU - Boasson, Luc
TI - Partial Words and a Theorem of Fine and Wilf.
JO - Theor. Comput. Sci.
VL - 218
IS - 1
SP - 135
EP - 141
PY - 1999//
DO - 10.1016/S0304-3975(98)00255-2
UR - https://doi.org/10.1016/S0304-3975(98)00255-2
ER -
TY - CPAPER
ID - DBLP:conf/birthday/Berstel99
AU - Berstel, Jean
TI - On the Index of Sturmian Words.
BT - Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
SP - 287
EP - 294
PY - 1999//
ER -
TY - JOUR
ID - DBLP:journals/eatcs/BerstelB97
AU - Berstel, Jean
AU - Boasson, Luc
TI - The set of Lyndon words is not context-free.
JO - Bull. EATCS
VL - 63
PY - 1997//
ER -
TY - JOUR
ID - DBLP:journals/jcss/BerstelB97
AU - Berstel, Jean
AU - Boasson, Luc
TI - The Set of Minimal Words of a Context-Free Language is Context-Free.
JO - J. Comput. Syst. Sci.
VL - 55
IS - 3
SP - 477
EP - 488
PY - 1997//
DO - 10.1006/JCSS.1997.1497
UR - https://doi.org/10.1006/jcss.1997.1497
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelL97
AU - Berstel, Jean
AU - Luca, Aldo de
TI - Sturmian Words, Lyndon Words and Trees.
JO - Theor. Comput. Sci.
VL - 178
IS - 1-2
SP - 171
EP - 203
PY - 1997//
DO - 10.1016/S0304-3975(96)00101-6
UR - https://doi.org/10.1016/S0304-3975(96)00101-6
UR - https://www.wikidata.org/entity/Q59487320
ER -
TY - CHAP
ID - DBLP:reference/hfl/AutebertBB97
AU - Autebert, Jean-Michel
AU - Berstel, Jean
AU - Boasson, Luc
TI - Context-Free Languages and Pushdown Automata.
BT - Handbook of Formal Languages, Volume 1: Word, Language, Grammar.
SP - 111
EP - 174
PY - 1997//
DO - 10.1007/978-3-642-59136-5_3
UR - https://doi.org/10.1007/978-3-642-59136-5_3
ER -
TY - JOUR
ID - DBLP:journals/dm/BerstelP96
AU - Berstel, Jean
AU - Pocchiola, Michel
TI - Random generation of finite Sturmian words.
JO - Discret. Math.
VL - 153
IS - 1-3
SP - 29
EP - 39
PY - 1996//
DO - 10.1016/0012-365X(95)00125-G
UR - https://doi.org/10.1016/0012-365X(95)00125-G
ER -
TY - JOUR
ID - DBLP:journals/fuin/BerstelB96
AU - Berstel, Jean
AU - Boasson, Luc
TI - Towards an Algebraic Theory of Context-Free Languages.
JO - Fundam. Informaticae
VL - 25
IS - 3
SP - 217
EP - 239
PY - 1996//
DO - 10.3233/FI-1996-253401
UR - https://doi.org/10.3233/FI-1996-253401
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelP96
AU - Berstel, Jean
AU - Pin, Jean-Eric
TI - Local Languages and the Berry-Sethi Algorithm.
JO - Theor. Comput. Sci.
VL - 155
IS - 2
SP - 439
EP - 446
PY - 1996//
DO - 10.1016/0304-3975(95)00104-2
UR - https://doi.org/10.1016/0304-3975(95)00104-2
ER -
TY - JOUR
ID - DBLP:journals/dm/AlloucheABBJPS95
AU - Allouche, Jean-Paul
AU - Arnold, André
AU - Berstel, Jean
AU - Brlek, Srecko
AU - Jockusch, William
AU - Plouffe, Simon
AU - Sagan, Bruce E.
TI - A relative of the Thue-Morse sequence.
JO - Discret. Math.
VL - 139
IS - 1-3
SP - 455
EP - 461
PY - 1995//
DO - 10.1016/0012-365X(93)00147-W
UR - https://doi.org/10.1016/0012-365X(93)00147-W
ER -
TY - CPAPER
ID - DBLP:conf/dlt/Berstel95
AU - Berstel, Jean
TI - Recent Results on Sturmian Words.
BT - Developments in Language Theory II, At the Crossroads of Mathematics, Computer Science and Biology, Magdeburg, Germany, 17-21 July 1995
SP - 13
EP - 24
PY - 1995//
ER -
TY - JOUR
ID - DBLP:journals/ita/BerstelS94
AU - Berstel, Jean
AU - Séébold, Patrice
TI - A Remark on Morphic Sturmian Words.
JO - RAIRO Theor. Informatics Appl.
VL - 28
IS - 3-4
SP - 255
EP - 263
PY - 1994//
DO - 10.1051/ITA/1994283-402551
UR - https://doi.org/10.1051/ita/1994283-402551
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelP94
AU - Berstel, Jean
AU - Pocchiola, Michel
TI - Average Cost of Duval's Algorithm for Generating Lyndon Words.
JO - Theor. Comput. Sci.
VL - 132
IS - 2
SP - 415
EP - 425
PY - 1994//
DO - 10.1016/0304-3975(94)00013-1
UR - https://doi.org/10.1016/0304-3975(94)00013-1
UR - https://www.wikidata.org/entity/Q56030650
ER -
TY - CPAPER
ID - DBLP:conf/birthday/Berstel94
AU - Berstel, Jean
TI - A Rewriting of Fife's Theorem about Overlap-Free Words.
BT - Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10-11, 1994, Proceedings
SP - 19
EP - 29
PY - 1994//
DO - 10.1007/3-540-58131-6_34
UR - https://doi.org/10.1007/3-540-58131-6_34
ER -
TY - JOUR
ID - DBLP:journals/dam/BerstelS93
AU - Berstel, Jean
AU - Séébold, Patrice
TI - A Characterization of Overlap-Free Morphisms.
JO - Discret. Appl. Math.
VL - 46
IS - 3
SP - 275
EP - 281
PY - 1993//
DO - 10.1016/0166-218X(93)90107-Y
UR - https://doi.org/10.1016/0166-218X(93)90107-Y
ER -
TY - JOUR
ID - DBLP:journals/ijac/BerstelP93
AU - Berstel, Jean
AU - Pocchiola, Michel
TI - A Geometric Proof of the Enumeration Formula for Sturmian Words.
JO - Int. J. Algebra Comput.
VL - 3
IS - 3
SP - 349
EP - 356
PY - 1993//
DO - 10.1142/S0218196793000238
UR - https://doi.org/10.1142/S0218196793000238
ER -
TY - CPAPER
ID - DBLP:conf/mfcs/BerstelS93
AU - Berstel, Jean
AU - Séébold, Patrice
TI - A Characterization of Sturmian Morphisms.
BT - Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings
SP - 281
EP - 290
PY - 1993//
DO - 10.1007/3-540-57182-5_20
UR - https://doi.org/10.1007/3-540-57182-5_20
UR - https://www.wikidata.org/entity/Q55885160
ER -
TY - CHAP
ID - DBLP:books/el/leeuwen90/BerstelB90
AU - Berstel, Jean
AU - Boasson, Luc
TI - Context-Free Languages.
BT - Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics
SP - 59
EP - 102
PY - 1990//
DO - 10.1016/B978-0-444-88074-1.50007-X
UR - https://doi.org/10.1016/b978-0-444-88074-1.50007-x
ER -
TY - JOUR
ID - DBLP:journals/dm/BerstelCP89
AU - Berstel, Jean
AU - Crochemore, Maxime
AU - Pin, Jean-Eric
TI - Thue-Morse sequence and p-adic topology for the free monoid.
JO - Discret. Math.
VL - 76
IS - 2
SP - 89
EP - 94
PY - 1989//
DO - 10.1016/0012-365X(89)90302-6
UR - https://doi.org/10.1016/0012-365X(89)90302-6
UR - https://www.wikidata.org/entity/Q61677980
ER -
TY - JOUR
ID - DBLP:journals/eatcs/Berstel89
AU - Berstel, Jean
TI - Langford strings are square free.
JO - Bull. EATCS
VL - 37
SP - 127
EP - 128
PY - 1989//
ER -
TY - JOUR
ID - DBLP:journals/jal/BergeronBBD89
AU - Bergeron, François
AU - Berstel, Jean
AU - Brlek, Srecko
AU - Duboc, Christine
TI - Addition Chains Using Continued Fractions.
JO - J. Algorithms
VL - 10
IS - 3
SP - 403
EP - 412
PY - 1989//
DO - 10.1016/0196-6774(89)90036-9
UR - https://doi.org/10.1016/0196-6774(89)90036-9
ER -
TY - CPAPER
ID - DBLP:conf/stacs/Berstel89
AU - Berstel, Jean
TI - Properties of Infinite Words: Recent Result.
BT - STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings
SP - 36
EP - 46
PY - 1989//
DO - 10.1007/BFB0028971
UR - https://doi.org/10.1007/BFb0028971
ER -
TY - BOOK
ID - DBLP:books/lib/BerstelR88
AU - Berstel, Jean
AU - Reutenauer, Christophe
TI - Rational series and their languages.
T3 - EATCS monographs on theoretical computer science
VL - 12
SP - I
EP - VIII
SP - 1
EP - 151
PY - 1988//
PB - Springer
UR - https://www.worldcat.org/oclc/17841475
SN - ISBN 0387186263
ER -
TY - CPAPER
ID - DBLP:conf/icalp/BerstelR88
AU - Berstel, Jean
AU - Reutenauer, Christophe
TI - Zeta Functions of Recognizable Languages.
BT - Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings
SP - 93
EP - 104
PY - 1988//
DO - 10.1007/3-540-19488-6_109
UR - https://doi.org/10.1007/3-540-19488-6_109
ER -
TY - CPAPER
ID - DBLP:conf/litp/Berstel88
AU - Berstel, Jean
TI - Finite automata and rational languages. An introduction.
BT - Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, Proceedings
SP - 2
EP - 14
PY - 1988//
DO - 10.1007/BFB0013107
UR - https://doi.org/10.1007/BFb0013107
ER -
TY - JOUR
ID - DBLP:journals/ipl/BerstelB87
AU - Berstel, Jean
AU - Brlek, Srecko
TI - On the Length of Word Chains.
JO - Inf. Process. Lett.
VL - 26
IS - 1
SP - 23
EP - 28
PY - 1987//
DO - 10.1016/0020-0190(87)90031-7
UR - https://doi.org/10.1016/0020-0190(87)90031-7
ER -
TY - JOUR
ID - DBLP:journals/ipl/Berstel86
AU - Berstel, Jean
TI - Every Iterated Morphism Yields a co-CFL.
JO - Inf. Process. Lett.
VL - 22
IS - 1
SP - 7
EP - 9
PY - 1986//
DO - 10.1016/0020-0190(86)90034-7
UR - https://doi.org/10.1016/0020-0190(86)90034-7
ER -
TY - CPAPER
ID - DBLP:conf/mfcs/BerstelS86
AU - Berstel, Jean
AU - Sakarovitch, Jacques
TI - Recent Results in the Theory of Rational Sets.
BT - Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings
SP - 15
EP - 28
PY - 1986//
DO - 10.1007/BFB0016231
UR - https://doi.org/10.1007/BFb0016231
ER -
TY - CPAPER
ID - DBLP:conf/stacs/Berstel84
AU - Berstel, Jean
TI - Some Recent Results on Squarefree Words.
BT - STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings
SP - 14
EP - 25
PY - 1984//
DO - 10.1007/3-540-12920-0_2
UR - https://doi.org/10.1007/3-540-12920-0_2
UR - https://www.wikidata.org/entity/Q64357148
ER -
TY - JOUR
ID - DBLP:journals/tcs/BerstelR82
AU - Berstel, Jean
AU - Reutenauer, Christophe
TI - Recognizable Formal Power Series on Trees.
JO - Theor. Comput. Sci.
VL - 18
SP - 115
EP - 148
PY - 1982//
DO - 10.1016/0304-3975(82)90019-6
UR - https://doi.org/10.1016/0304-3975(82)90019-6
ER -
TY - JOUR
ID - DBLP:journals/iandc/BeauquierB81
AU - Beauquier, Joffroy
AU - Berstel, Jean
TI - More about the "Geography" of Context-Free Languages
JO - Inf. Control.
VL - 49
IS - 2
SP - 91
EP - 108
PY - 1981/05/
DO - 10.1016/S0019-9958(81)90456-3
UR - https://doi.org/10.1016/S0019-9958(81)90456-3
ER -
TY - CPAPER
ID - DBLP:conf/mfcs/BeauquierB81
AU - Beauquier, Joffroy
AU - Berstel, Jean
TI - More about the "Geography" of Context-Free Languages.
BT - Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings
SP - 183
EP - 192
PY - 1981//
DO - 10.1007/3-540-10856-4_84
UR - https://doi.org/10.1007/3-540-10856-4_84
ER -
TY - JOUR
ID - DBLP:journals/dm/Berstel80
AU - Berstel, Jean
TI - Mots sans carre et morphismes iteres.
JO - Discret. Math.
VL - 29
IS - 3
SP - 235
EP - 244
PY - 1980//
DO - 10.1016/0012-365X(80)90151-X
UR - https://doi.org/10.1016/0012-365X(80)90151-X
ER -
TY - CPAPER
ID - DBLP:conf/caap/BerstelR80
AU - Berstel, Jean
AU - Reutenauer, Christophe
TI - Séries formelles reconnaissables d'arbres et applications.
BT - Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, Lilli, France, 21, 22 et 23 févier 1980
SP - 11
EP - 21
PY - 1980//
ER -
TY - BOOK
ID - DBLP:books/lib/Berstel79
AU - Berstel, Jean
TI - Transductions and context-free languages.
T3 - Teubner Studienbücher : Informatik
VL - 38
SP - 1
EP - 278
PY - 1979//
PB - Teubner
UR - https://www.worldcat.org/oclc/06364613
SN - ISBN 3519023407
ER -
TY - CPAPER
ID - DBLP:conf/icalp/Berstel79
AU - Berstel, Jean
TI - Sur les mots sans carré définis par un morphisme.
BT - Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings
SP - 16
EP - 25
PY - 1979//
DO - 10.1007/3-540-09510-1_2
UR - https://doi.org/10.1007/3-540-09510-1_2
ER -
TY - CPAPER
ID - DBLP:conf/fct/Berstel77
AU - Berstel, Jean
TI - Some Recent Results on Recognizable Formal Power Series.
BT - Fundamentals of Computation Theory, Proceedings of the 1977 International FCT-Conference, Poznan-Kórnik, Poland, September 19-23, 1977
SP - 39
EP - 48
PY - 1977//
DO - 10.1007/3-540-08442-8_68
UR - https://doi.org/10.1007/3-540-08442-8_68
ER -
TY - CPAPER
ID - DBLP:conf/Lsystems/BerstelN75
AU - Berstel, Jean
AU - Nielsen, Mogens
TI - The Growth Range Equivalence Problem for DOL Systems is Decidable.
BT - Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31 - April 6, 1975.
SP - 161
EP - 178
PY - 1975//
ER -
TY - JOUR
ID - DBLP:journals/acta/Berstel74
AU - Berstel, Jean
TI - Sur une Conjecture de S. Greibach.
JO - Acta Informatica
VL - 3
SP - 293
EP - 295
PY - 1974//
DO - 10.1007/BF00288640
UR - https://doi.org/10.1007/BF00288640
UR - https://www.wikidata.org/entity/Q122988771
ER -
TY - CPAPER
ID - DBLP:conf/icalp/BerstelB74
AU - Berstel, Jean
AU - Boasson, Luc
TI - Une suite decroissante de cônes rationnels.
BT - Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29 - August 2, 1974, Proceedings
SP - 383
EP - 397
PY - 1974//
DO - 10.1007/3-540-06841-4_76
UR - https://doi.org/10.1007/3-540-06841-4_76
ER -
TY - JOUR
ID - DBLP:journals/mst/Berstel73
AU - Berstel, Jean
TI - Une Hiérarchie des Parties Rationelles de N².
JO - Math. Syst. Theory
VL - 7
IS - 2
SP - 114
EP - 137
PY - 1973//
DO - 10.1007/BF01762231
UR - https://doi.org/10.1007/BF01762231
ER -
TY - THES
ID - DBLP:books/daglib/0012755
AU - Berstel, Jean
TI - Contribution a l'etude des proprietes arithmetiques des langages formels.
SP - I
EP - III
SP - 1
EP - 131
PY - 1972//
ER -
TY - CPAPER
ID - DBLP:conf/focs/Berstel72
AU - Berstel, Jean
TI - On Sets of Numbers Recognized by Push-Down Automata
BT - 13th Annual Symposium on Switching and Automata Theory, College Park, Maryland, USA, October 25-27, 1972
SP - 200
EP - 206
PY - 1972//
DO - 10.1109/SWAT.1972.11
UR - https://doi.org/10.1109/SWAT.1972.11
UR - https://doi.ieeecomputersociety.org/10.1109/SWAT.1972.11
ER -
TY - CPAPER
ID - DBLP:conf/icalp/Berstel72
AU - Berstel, Jean
TI - Sur la densité asymptotique de langages formels.
BT - Automata, Languages and Programming, Colloquium, Paris, France, July 3-7, 1972
SP - 345
EP - 358
PY - 1972//
ER -
