This repository has been archived by the owner on Apr 9, 2019. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bibliographie.bib
1927 lines (1736 loc) · 65.7 KB
/
Bibliographie.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
%% This BibTeX bibliography file was created using BibDesk.
%% http://bibdesk.sourceforge.net/
%% Created for Jérôme Tremblay at 2016-03-24 15:09:44 -0400
%% Saved with string encoding Unicode (UTF-8)
@article{Boas80,
Author = {Peter van Emde Boas},
Bibsource = {dblp computer science bibliography, http://dblp.org},
Biburl = {http://dblp.uni-trier.de/rec/bib/journals/ipl/Boas80},
Date-Added = {2016-03-24 19:09:17 +0000},
Date-Modified = {2016-03-24 19:09:26 +0000},
Doi = {10.1016/0020-0190(80)90064-2},
Journal = {Inf. Process. Lett.},
Number = {3},
Pages = {132--136},
Timestamp = {Thu, 07 Jul 2011 15:51:20 +0200},
Title = {On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination},
Url = {http://dx.doi.org/10.1016/0020-0190(80)90064-2},
Volume = {10},
Year = {1980},
Bdsk-Url-1 = {http://dx.doi.org/10.1016/0020-0190(80)90064-2}}
@article{Avis198281,
Abstract = {An n log n lower bound is found for linear decision tree algorithms with integer inputs that either identify the convex hull of a set of points or compute its cardinality. },
Author = {Davis Avis},
Date-Added = {2016-03-24 19:02:58 +0000},
Date-Modified = {2016-03-24 19:02:58 +0000},
Doi = {http://dx.doi.org/10.1016/0166-218X(82)90065-8},
Issn = {0166-218X},
Journal = {Discrete Applied Mathematics},
Number = {2},
Pages = {81 - 86},
Title = {On the complexity of finding the convex hull of a set of points},
Url = {http://www.sciencedirect.com/science/article/pii/0166218X82900658},
Volume = {4},
Year = {1982},
Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/0166218X82900658},
Bdsk-Url-2 = {http://dx.doi.org/10.1016/0166-218X(82)90065-8}}
@book{fulton97,
Author = {William Fulton},
Date-Added = {2016-03-24 18:45:08 +0000},
Date-Modified = {2016-03-24 18:45:52 +0000},
Publisher = {Cambridge University Press},
Title = {Young Tableaux: With Applications to Representation Theory and Geometry},
Year = {1997}}
@article{Duval83,
Abstract = {An efficient algorithm to obtain a factorization of words over an ordered alphabet known as Lyndon factorization is presented. Applications of this algorithm are given to the computation of the least suffix of a word and the least circular shift of a word. },
Author = {Jean Pierre Duval},
Date-Added = {2016-01-13 16:28:53 +0000},
Date-Modified = {2016-01-13 16:29:02 +0000},
Issn = {0196-6774},
Journal = {Journal of Algorithms},
Number = {4},
Pages = {363 - 381},
Title = {Factorizing words over an ordered alphabet},
Volume = {4},
Year = {1983},
Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/0196677483900172},
Bdsk-Url-2 = {http://dx.doi.org/10.1016/0196-6774(83)90017-2}}
@phdthesis{blondin12,
Author = {Alexandre {Blondin~Mass\'e}},
Date-Added = {2016-01-13 16:22:30 +0000},
Date-Modified = {2016-01-13 18:35:59 +0000},
Month = {F{\'e}vrier},
School = {Universit\'e du Qu\'ebec \`a Montr\'eal},
Title = {{{\`A}} l'intersection de la combinatoire des mots et de la g{{\'e}}om{{\'e}}trie discr{{\`e}}te: Palindromes, sym{{\'e}}tries et pavages},
Type = {Th{\`e}se de doctorat},
Year = {2012}}
@article{Chaudhuri98,
Abstract = {The problems of defining convexity and circularity of a digital region are considered. A new definition of digital convexity, called DL- (digital line) convexity, is proposed. A region is DL-convex if, for any two pixels belonging to it, there exists a digital straight line between them all of whose pixels belong to the region. DL-convexity is shown to be stronger that two other definitions, T- (triangle) convexity and L- (line) convexity. A digital region is T-convex if it is DL-convex, but the converse is not generally true. This is because a DL-convex region must be connected, but T- and L-convex regions can be disconnected. An algorithm to compute the DL-convex hull of a digital region is described. A related problem, the computation of the circular hull and its application to testing the circularity of a digital region, is also considered, and an algorithm is given that is computationally cheaper than a previous algorithm for testing circularity. },
Author = {B.B. Chaudhuri and A. Rosenfeld},
Date-Added = {2016-01-12 21:14:01 +0000},
Date-Modified = {2016-01-13 15:39:54 +0000},
Issn = {0031-3203},
Journal = {Pattern Recognition},
Keywords = {Circular hull},
Number = {12},
Pages = {2007 - 2016},
Title = {On the computation of the digital convex hull and circular hull of a digital region},
Volume = {31},
Year = {1998},
Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S003132039800065X},
Bdsk-Url-2 = {http://dx.doi.org/10.1016/S0031-3203(98)00065-X}}
@article{Melkman87,
Author = {Melkman, Avraham A.},
Coden = {IFPLAT},
Date-Added = {2016-01-12 20:56:24 +0000},
Date-Modified = {2016-01-13 15:38:34 +0000},
Fjournal = {Information Processing Letters},
Issn = {0020-0190},
Journal = {Inform. Process. Lett.},
Mrclass = {68U05 (52-04 68P05 68Q20)},
Mrnumber = {896397 (88f:68134)},
Number = {1},
Pages = {11--12},
Title = {On-line construction of the convex hull of a simple polyline},
Volume = {25},
Year = {1987},
Bdsk-Url-1 = {http://dx.doi.org/10.1016/0020-0190(87)90086-X}}
@article{McCallumAvis,
Author = {McCallum, Duncan and Avis, David},
Coden = {IPFLAT},
Date-Added = {2016-01-12 20:55:16 +0000},
Date-Modified = {2016-01-13 15:35:18 +0000},
Fjournal = {Information Processing Letters},
Issn = {0020-0190},
Journal = {Information Processing Letters},
Mrclass = {68C05},
Mrnumber = {552534 (80k:68021)},
Number = {5},
Pages = {201--206},
Title = {A linear algorithm for finding the convex hull of a simple polygon},
Volume = {9},
Year = {1979},
Bdsk-Url-1 = {http://dx.doi.org/10.1016/0020-0190(79)90069-3}}
@article{Chan96,
Abstract = {We present simple output-sensitive algorithms that construct the convex hull of a set ofn points in two or three dimensions in worst-case optimalO (n logh) time andO (n) space, whereh denotes the number of vertices of the convex hull.},
Author = {Chan, T. M.},
Date-Added = {2016-01-12 20:46:40 +0000},
Date-Modified = {2016-01-13 15:40:50 +0000},
Issn = {1432-0444},
Journal = {Discrete \& Computational Geometry},
Number = {4},
Pages = {361--368},
Title = {Optimal output-sensitive convex hull algorithms in two and three dimensions},
Volume = {16},
Year = {1996},
Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF02712873}}
@inproceedings{KimLee,
Author = {Kim, M.A. and Lee, E.J. and Cho, H.G. and Park, K.J},
Booktitle = {Proceedings of the Fifth International Conference in Central Europe in Computer Graphics and Visualization},
Date-Added = {2016-01-12 20:40:21 +0000},
Date-Modified = {2016-01-13 15:32:43 +0000},
Pages = {212--221},
Title = {A visualization technique for DNA walk plot using $k$-convex hull},
Year = {1997}}
@article{Chrl1875,
Author = {E. B. Christoffel},
Date-Added = {2016-01-12 19:08:25 +0000},
Date-Modified = {2016-01-12 19:17:05 +0000},
Journal = {Annali di Matematica},
Pages = {145-152},
Title = {Observatio arithmetica},
Volume = {6},
Year = {1875}}
@article{Bresenham65,
Acmid = {1663349},
Address = {Riverton, NJ, USA},
Author = {Bresenham, J. E.},
Date-Added = {2016-01-12 19:05:32 +0000},
Date-Modified = {2016-01-13 15:45:29 +0000},
Issn = {0018-8670},
Issue_Date = {March 1965},
Journal = {IBM Syst. J.},
Month = mar,
Number = {1},
Numpages = {6},
Pages = {25--30},
Publisher = {IBM Corp.},
Title = {Algorithm for Computer Control of a Digital Plotter},
Volume = {4},
Year = {1965},
Bdsk-Url-1 = {http://dx.doi.org/10.1147/sj.41.0025}}
@article{Rosenfeld69,
Acmid = {356554},
Address = {New York, NY, USA},
Author = {Rosenfeld, Azriel},
Date-Added = {2016-01-12 19:01:33 +0000},
Date-Modified = {2016-01-13 15:35:46 +0000},
Issn = {0360-0300},
Issue_Date = {Sept. 1969},
Journal = {ACM Comput. Surv.},
Month = sep,
Number = {3},
Numpages = {30},
Pages = {147--176},
Publisher = {ACM},
Title = {Picture Processing by Computer},
Volume = {1},
Year = {1969},
Bdsk-Url-1 = {http://doi.acm.org/10.1145/356551.356554},
Bdsk-Url-2 = {http://dx.doi.org/10.1145/356551.356554}}
@article{Lubensky79,
Author = {T.C. Lubensky and Joel Isaacson},
Date-Added = {2016-01-07 18:58:11 +0000},
Date-Modified = {2016-01-07 18:59:31 +0000},
Journal = {Physical Review A},
Number = {5},
Title = {Statistics of lattice animals and dilute branched polymers},
Volume = {20},
Year = {1979}}
@article{C3SM52805G,
Abstract = {A Flory theory is constructed for a long polymer ring in a melt of unknotted and non-concatenated rings. The theory assumes that the ring forms an effective annealed branched object and computes its primitive path. It is shown that the primitive path follows self-avoiding statistics and is characterized by the corresponding Flory exponent of a polymer with excluded volume. Based on that{,} it is shown that rings in the melt are compact objects with overall size proportional to their length raised to the 1/3 power. Furthermore{,} the contact probability exponent [gamma]contact is estimated{,} albeit by a poorly controlled approximation{,} with the result close to 1.1 consistent with both numerical and experimental data.},
Author = {Grosberg, Alexander Y.},
Date-Added = {2016-01-07 18:49:24 +0000},
Date-Modified = {2016-01-13 15:42:14 +0000},
Issue = {4},
Journal = {Soft Matter},
Pages = {560-565},
Publisher = {The Royal Society of Chemistry},
Title = {Annealed lattice animal model and Flory theory for the melt of non-concatenated rings: towards the physics of crumpling},
Volume = {10},
Year = {2014},
Bdsk-Url-1 = {http://dx.doi.org/10.1039/C3SM52805G}}
@book{gross87,
Author = {Gross, J.L. and Tucker, T.W.},
Date-Added = {2015-07-02 15:48:45 +0000},
Date-Modified = {2016-01-13 15:41:52 +0000},
Isbn = {9780486417417},
Lccn = {87006221},
Publisher = {Dover Publications},
Series = {Dover Books on Mathematics Series},
Title = {Topological Graph Theory},
Year = {1987},
Bdsk-Url-1 = {https://books.google.ca/books?id=mrv9OJVdy%5C_cC}}
@article{spitzer56,
Author = {Spitzer, Frank},
Copyright = {Copyright {\copyright} 1956 American Mathematical Society},
Date-Added = {2015-07-01 19:45:01 +0000},
Date-Modified = {2016-01-13 15:36:43 +0000},
Issn = {00029947},
Journal = {Transactions of the American Mathematical Society},
Jstor_Articletype = {research-article},
Jstor_Formatteddate = {Jul., 1956},
Language = {English},
Number = {2},
Pages = {pp. 323-339},
Publisher = {American Mathematical Society},
Title = {A Combinatorial Lemma and Its Application to Probability Theory},
Volume = {82},
Year = {1956},
Bdsk-Url-1 = {http://www.jstor.org/stable/1993051}}
@article{kim,
Abstract = {A convex decomposition method, called the alternating sum of volumes (ASV) method, uses convex hulls and set-difference operations. \{ASV\} decomposition may not converge, which severely limits the domain of geometric objects that can be handled. Via the combination of \{ASV\} decomposition and remedial partitioning for the non-convergence, a convergent convex decomposition is proposed that is called the alternating sum of volumes with partitioning (ASVP) decomposition. The paper describes how \{ASVP\} decomposition is used for the recognition of form features. In this approach to form-feature recognition, volumetric form features which are intrinsic to the shape of a given object are recognized from the boundary information through \{ASVP\} decomposition. Moreover, hierarchical relationships between the recognized form features are obtained in addition to global spatial information. },
Author = {Y.S. Kim},
Date-Added = {2015-06-25 15:54:41 +0000},
Date-Modified = {2016-01-13 15:34:13 +0000},
Issn = {0010-4485},
Journal = {Computer-Aided Design},
Keywords = {geometric reasoning},
Number = {9},
Pages = {461 - 476},
Title = {Recognition of form features using convex decomposition},
Volume = {24},
Year = {1992},
Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/0010448592900278},
Bdsk-Url-2 = {http://dx.doi.org/10.1016/0010-4485(92)90027-8}}
@article{Sherali199483,
Author = {Hanif D. Sherali and Warren P. Adams},
Date-Added = {2015-06-25 15:52:28 +0000},
Date-Modified = {2016-01-13 15:36:21 +0000},
Issn = {0166-218X},
Journal = {Discrete Applied Mathematics},
Keywords = {Disjunctive programming},
Number = {1},
Pages = {83 - 106},
Title = {A hierarchy of relaxations and convex hull characterizations for mixed-integer zero---one programming problems},
Volume = {52},
Year = {1994},
Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/0166218X9200190W},
Bdsk-Url-2 = {http://dx.doi.org/10.1016/0166-218X(92)00190-W}}
@book{Gruber,
Author = {Peter M. {Gruber}},
Date-Added = {2015-06-25 15:45:01 +0000},
Date-Modified = {2016-01-13 15:44:32 +0000},
Isbn = {978-3-540-71132-2/hbk},
Language = {English},
Msc2010 = {52-02 52A40 52A27 52B20},
Pages = {xiv + 578},
Publisher = {Berlin: Springer},
Title = {Convex and discrete geometry},
Year = {2007},
Zbl = {1139.52001},
Bdsk-Url-1 = {http://dx.doi.org/10.1007/978-3-540-71133-9}}
@article{Graham1972132,
Author = {R.L. Graham},
Date-Added = {2015-06-25 15:31:25 +0000},
Date-Modified = {2016-01-13 15:41:32 +0000},
Issn = {0020-0190},
Journal = {Information Processing Letters},
Number = {4},
Pages = {132 - 133},
Title = {An efficient algorith for determining the convex hull of a finite planar set},
Volume = {1},
Year = {1972},
Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUGJCVYJHZlcnNpb25YJG9iamVjdHNZJGFyY2hpdmVyVCR0b3ASAAGGoKgHCBMUFRYaIVUkbnVsbNMJCgsMDxJXTlMua2V5c1pOUy5vYmplY3RzViRjbGFzc6INDoACgAOiEBGABIAFgAdccmVsYXRpdmVQYXRoWWFsaWFzRGF0YV8QHC4uLy4uLy5UcmFzaC9zY2llbmNlICgzKS5iaWLSFwsYGVdOUy5kYXRhTxEBegAAAAABegACAAAMTWFjaW50b3NoIEhEAAAAAAAAAAAAAAAAAAAAzwvalkgrAAABbh0VD3NjaWVuY2UgKDMpLmJpYgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHaJq7RsZw7AAAAAAAAAAAAAgACAAAJIAAAAAAAAAAAAAAAAAAAAAYuVHJhc2gAEAAIAADPDCDmAAAAEQAIAADRsdR7AAAAAQAMAW4dFQAGIJ4AAmRTAAIAM01hY2ludG9zaCBIRDpVc2VyczoAamVyb21lOgAuVHJhc2g6AHNjaWVuY2UgKDMpLmJpYgAADgAgAA8AcwBjAGkAZQBuAGMAZQAgACgAMwApAC4AYgBpAGIADwAaAAwATQBhAGMAaQBuAHQAbwBzAGgAIABIAEQAEgAjVXNlcnMvamVyb21lLy5UcmFzaC9zY2llbmNlICgzKS5iaWIAABMAAS8AABUAAgAN//8AAIAG0hscHR5aJGNsYXNzbmFtZVgkY2xhc3Nlc11OU011dGFibGVEYXRhox0fIFZOU0RhdGFYTlNPYmplY3TSGxwiI1xOU0RpY3Rpb25hcnmiIiBfEA9OU0tleWVkQXJjaGl2ZXLRJidUcm9vdIABAAgAEQAaACMALQAyADcAQABGAE0AVQBgAGcAagBsAG4AcQBzAHUAdwCEAI4ArQCyALoCOAI6Aj8CSgJTAmECZQJsAnUCegKHAooCnAKfAqQAAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAACpg==},
Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/0020019072900452},
Bdsk-Url-2 = {http://dx.doi.org/10.1016/0020-0190(72)90045-2}}
@misc{alexis,
Author = {A. Monnerot-Dumaine},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Note = {published electronically at http://hal.archives-ouvertes.fr/hal-00367972/fr/},
Title = {The {F}ibonacci word fractal},
Year = {2009}}
@inproceedings{bbgl09,
Author = {A. {B}londin~Mass{\'e} and S. {B}rlek and A. {G}aron and S. Labb{\'e}},
Booktitle = {DGCI 2009, 15th IAPR Int. Conf. on Discrete Geometry for Computer Imagery},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Editor = {S. Brlek and X. Proven\c{c}al and C. Reutenauer},
Note = {to appear},
Publisher = {Springer-Verlag},
Series = {LNCS},
Title = {{C}hristoffel and {F}ibonacci Tiles},
Year = {2009}}
@article{bblm,
Author = {A. {B}londin~Mass{\'e} and {S}. Brlek and S. Labb{\'e} and M. Mend\`es France},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Ann. Sci. Math. Qu\'ebec},
Note = {to appear},
Title = {Fibonacci snowflakes},
Volume = {35},
Year = {2011}}
@article{BFRV06,
Author = {Srecko Brlek and Andrea Frosini and Simone Rinaldi and Laurent Vuillon},
Bibsource = {DBLP, http://dblp.uni-trier.de},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Ee = {http://www.combinatorics.org/Volume_13/Abstracts/v13i1r15.html},
Journal = {Electr. J. Comb.},
Number = {1},
Title = {Tilings by Translation: Enumeration by a Rational Language Approach},
Volume = {13},
Year = {2006}}
@article{bll3,
Author = {S. Brlek and G. Labelle and A. Lacasse},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Int. J. Found. Comput. Sci.},
Number = {3},
Pages = {543--556},
Title = {Properties of the Contour Path of Discrete Sets},
Volume = {17},
Year = 2006}
@article{BLPR00,
Author = {E. Barcucci and A. Del Lungo and E. Pergola and R. Pinzani},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:16:07 +0000},
Journal = {Discrete Math.},
Pages = {33--49},
Title = {From {M}otzkin to {C}atalan Permutations},
Volume = {217},
Year = {2000)}}
@article{borelreut,
Author = {J.-P. Borel and C. Reutenauer},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {RAIRO-Theoretical Informatics and Applications},
Pages = {15--28},
Title = {On Christoffel classes},
Volume = {40},
Year = 2006}
@inproceedings{bp,
Address = {Prague, Czech Republic},
Author = {Sre{\v{c}}ko Brlek and Xavier Proven{\c{c}}al},
Bibsource = {http://www.stringology.org/event/2006/psc06p08.bib},
Booktitle = {Proceedings of the Prague Stringology Conference~'06},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Editor = {Jan Holub and Jan {\v{Z}}{\v{d}}{\'{a}}rek},
Month = {28--30~} # aug,
Pages = {65--76},
Publisher = {Czech Technical University in Prague},
Series = {ISBN80-01-03533-6},
Title = {On the problem of deciding if a polyomino tiles the plane by translation},
Year = 2006}
@inproceedings{bpdgci,
Author = {Sre\v{c}ko {B}rlek and Xavier Proven\c{c}al},
Booktitle = {Discrete Geometry for Computer Imagery, 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Editor = {Attila Kuba and L{\'a}szl{\'o} G. Ny{\'u}l and K{\'a}lm{\'a}n Pal{\'a}gyi},
Pages = {403--412},
Publisher = {Springer},
Series = {Lecture Notes in Computer Science},
Title = {An Optimal Algorithm for Detecting Pseudo-squares.},
Volume = {4245},
Year = {2006}}
@article{bpfDAM,
Author = {Sre\v{c}ko {B}rlek and Xavier Proven\c{c}al and Jean-Marc F\'edou},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Discrete Applied Mathematics},
Number = {3},
Pages = {464--475},
Title = {On the tiling by translation problem},
Volume = {157},
Year = {2009}}
@article{brs,
Author = {Y. Bugeaud and C. Reutenauer and S. Siksek},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Theor. Comput. Sci.},
Number = {30-32},
Pages = {2864--2869},
Title = {A Sturmian sequence related to the uniqueness conjecture for Markoff numbers},
Volume = {410},
Year = {2009}}
@article{cauchy,
Author = {A.-L. Cauchy},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {M\'em. Acad. Sci.},
Pages = {3--15},
Title = {M\'emoire sur la rectification des courbes et la quadrature des surfaces courbes},
Volume = {22},
Year = {1850}}
@mastersthesis{Cloutier,
Address = {Trois-Rivi\`eres},
Author = {Hugo Cloutier},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
School = {Universit\'{e} du Qu\'{e}bec \`{a} Trois-Rivi\`{e}res},
Title = {{\'{E}num\'{e}ration de polyominos \`{a} deux et \`{a} trois dimensions}},
Year = {2010}}
@article{crofton,
Author = {M. W. Crofton},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Phil. Trans. of the royal soc. London},
Pages = {181--199},
Title = {On the theory of local probability, applied to straight lines drawn at random in a plane; the methods used being also extended to the proof of certain new theorems in the integral calculus},
Volume = {158},
Year = {1868}}
@article{dbintr70,
Author = {D. H. Redelmeier},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Disc. Math.},
Pages = {191--203},
Title = {Counting polyominoes: yet another attack},
Volume = {36},
Year = 1981}
@article{EggeMansour,
Author = {E. S. Egge and T. Mansour},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Discrete Applied Mathematics},
Number = {1-3},
Pages = {72--83},
Title = {132-avoiding two-stack sortable permutations, {F}ibonacci numbers, and {P}ell numbers},
Volume = {143},
Year = {2004}}
@book{EIS,
Address = {San Diego},
Author = {Neil J. A. Sloane and Simon Plouffe},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Publisher = {Academic Press},
Title = {The encyclopedia of integer sequences},
Year = {1995}}
@article{frobenius,
Author = {G.F. Frobenius},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Sitzungsberichte der K{\"o}niglich {P}reussischen {A}kademie der {W}issenschaften zu {B}erlin},
Pages = {458--487},
Title = {{\"U}ber die {M}arkoffsche {Z}ahlen},
Year = 1913}
@article{Ga,
Author = {M. Gardner},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Scientific American},
Pages = {Sept. 182--192, Nov. 136--142},
Title = {Mathematical games},
Year = 1958}
@article{GCN10,
Author = {Alain Goupil and Hugo Cloutier and Fathallah Nouboud},
Bibsource = {DBLP, http://dblp.uni-trier.de},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Ee = {http://dx.doi.org/10.1016/j.dam.2010.08.011},
Journal = {Discrete Applied Mathematics},
Number = {18},
Pages = {2014-2023},
Title = {Enumeration of polyominoes inscribed in a rectangle},
Volume = {158},
Year = {2010}}
@webpage{gogame,
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:20:34 +0000},
Lastchecked = {Thursday, May 7, 2015},
Title = {Go (game) - Wikipedia, the free encyclopedia},
Url = {http://en.wikipedia.org/wiki/Go_(game)},
Year = 2015,
Bdsk-Url-1 = {http://en.wikipedia.org/wiki/Go_(game)}}
@book{Golomb,
Address = {Princeton},
Author = {S. W. Golomb},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Publisher = {Princeton Academic Press},
Title = {Polyominoes: Puzzles, Patterns, Problems, and Packings},
Year = 1996}
@article{gv,
Author = {I. Gambini and L. Vuillon},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Theoret. Informatics Appl.},
Pages = {147--155},
Title = {An algorithm for deciding if a polyomino tiles the plane by translations},
Volume = {41},
Year = 2007}
@article{Jen,
Author = {Iwan Jensen},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Issues = {3-4},
Journal = {J. Stat. Mechanics},
Pages = {865--881},
Title = {Enumerations of Lattice Animals and Trees},
Volume = {102},
Year = 2001}
@article{JenGutt,
Author = {{Jensen}, I. and {Guttmann}, A.~J.},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Journal of Physics},
Month = jul,
Pages = {L257-L263},
Title = {{Statistics of lattice animals (polyominoes) and polygons}},
Volume = 33,
Year = 2000}
@techreport{KlarnerRivest,
Address = {Stanford, CA, USA},
Author = {Klarner, David A. and Rivest, Ronald L.},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Publisher = {Stanford University},
Source = {http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail\&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-72-263},
Title = {A procedure for improving the upper bound for the number of n-ominoes.},
Year = {1972}}
@book{lcf,
Address = {Cambridge},
Author = {M. Lothaire},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Publisher = {Cambridge University Press},
Title = {Applied Combinatorics on Words},
Year = 2005}
@book{Loth,
Address = {Cambridge},
Author = {M. Lothaire},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Publisher = {Cambridge University Press},
Title = {Combinatorics on Words},
Year = 1997}
@article{MBM03,
Author = {M. Bousquet-M{\'e}lou and A. Rechnitzer},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Advances in Applied Mathematics},
Number = {1},
Pages = {86--112},
Title = {The Site Perimeter of Bargraphs},
Volume = {31},
Year = {2003}}
@article{MBM94,
Author = {Mireille Bousquet-M{\'e}lou},
Bibsource = {DBLP, http://dblp.uni-trier.de},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Ee = {http://dx.doi.org/10.1016/0166-218X(92)00103-S},
Journal = {Discrete Applied Mathematics},
Number = {1},
Pages = {21--43},
Title = {Codage des polyominos convexes et {\'e}quations pour l'{\'e}num{\'e}ration suivant l'aire},
Volume = {48},
Year = {1994}}
@article{MBM96,
Author = {Mireille Bousquet-M{\'e}lou},
Bibsource = {DBLP, http://dblp.uni-trier.de},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Ee = {http://dx.doi.org/10.1016/0012-365X(95)00003-F},
Journal = {Discrete Mathematics},
Number = {1-3},
Pages = {1--25},
Title = {A method for the enumeration of various classes of column-convex polygons},
Volume = {154},
Year = {1996}}
@article{MBM98,
Author = {Mireille Bousquet-M{\'e}lou},
Bibsource = {DBLP, http://dblp.uni-trier.de},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Ee = {http://dx.doi.org/10.1016/S0012-365X(97)00109-X},
Journal = {Discrete Mathematics},
Number = {1-3},
Pages = {73--106},
Title = {New enumerative results on two-dimensional directed animals},
Volume = {180},
Year = {1998}}
@inproceedings{Mmf,
Author = {M. Mend\`es France},
Booktitle = {in Fractal Geometry and Analysis},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Editor = {J. B\'elair and S. Dubuc},
Pages = {325--366},
Publisher = {Kluwer Academic Publishers},
Title = {The {P}lanck constant of a curve},
Volume = {346},
Year = 1991}
@article{My,
Author = {Joseph Samuel Myers},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {available electronically at http://www.srcf.ucam.org/$\sim$jsm28/tiling},
Title = {Polyomino tiling},
Year = 2006}
@misc{OEIS,
Author = {N. J. A. Sloane},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Note = {published electronically at http://www.research.att.com/?njas/sequences},
Title = {The On-Line Encyclopedia of Integer Sequences},
Year = 2011}
@misc{oeisA001168,
Author = {N. J. A. Sloane},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2016-01-13 15:37:59 +0000},
Howpublished = {\href{http://oeis.org/A001168}},
Note = {Number of fixed polyominoes with n cells.},
Title = {The {O}n-{L}ine {E}ncyclopedia of {I}nteger {S}equences},
Year = {2005}}
@misc{oeisA057730,
Author = {N. J. A. Sloane},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-06-25 17:22:20 +0000},
Howpublished = {\href{}{A057730}},
Month = {10},
Note = {Number of polyominoes (A000105) with perimeter 2n.},
Title = {The {O}n-{L}ine {E}ncyclopedia of {I}nteger {S}equences},
Year = {2000}}
@article{pirillo1,
Author = {G. Pirillo},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {S\'em. Lothar. Combin.},
Pages = {1--3},
Title = {A new characteristic property of the palindrome of standard Sturmian word},
Volume = {43},
Year = 1999}
@inproceedings{pirillo2,
Address = {Montreal, Canada},
Author = {G. Pirillo},
Booktitle = {Proc.~Words2005, 5-th International Conference on Words},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Editor = {S. Brlek and C. Reutenauer},
Month = {13--17~} # sep,
Pages = {289--294},
Publisher = {Publications du LaCIM},
Title = {A note on the number of distinct squares in a word},
Volume = 36,
Year = 2005}
@article{pol,
Author = {G. P\'olya},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {J. Combinatorial Theory},
Pages = {102--105},
Title = {On the number of certain lattice polygons},
Volume = {6},
Year = 1969}
@manual{ppss,
Author = {Louwrentius},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Key = {ppss},
Note = {{\tt http://code.google.com/p/ppss}},
Title = {$|$P$|$P$|$S$|$S$|$ - (Distributed) Parallel Processing Shell Script},
Year = {2011}}
@book{PrusLind,
Address = {New York, NY, USA},
Author = {Prusinkiewicz,, P. and Lindenmayer,, Aristid},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Isbn = {0-387-97297-8},
Publisher = {Springer-Verlag New York, Inc.},
Title = {The algorithmic beauty of plants},
Year = {1990}}
@misc{Putnam1999,
Author = {M. Bhargava and K. Kedlaya and L. Ng},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Note = {published electronically at http://www.unl.edu/amc/a-activities/a7-problems/putnam/-pdf/1999s.pdf},
Title = {Solutions to the 60th {W}illiam {L}owell {P}utnam Mathematical Competition},
Year = 1999}
@article{Red,
Author = {D. Hugh Redelmeier},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Discrete Mathematics},
Pages = {191--203},
Title = {Counting polyominoes: yet another attack},
Volume = {36},
Year = 1981}
@article{reut1,
Author = {C. Reutenauer},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Integers},
Number = {3},
Pages = {327--332},
Title = {Christoffel Words and Markoff Triples},
Volume = {9},
Year = 2009}
@book{Ribenboim04,
Address = {New York},
Author = {P. Ribenboim},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Isbn = {0-387-97508-X},
Pages = {viii+237},
Publisher = {Springer-Verlag},
Title = {The little book of bigger primes, 2nd ed.},
Year = {2004}}
@book{Ribenboim96,
Address = {New York},
Author = {P. Ribenboim},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Publisher = {Springer},
Title = {The New Book of Prime Number Records},
Year = 1996}
@book{RozSal,
Address = {Orlando, FL, USA},
Author = {Rozenberg,, Grzegorz and Salomaa,, Arto},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Isbn = {0125971400},
Publisher = {Academic Press, Inc.},
Title = {Mathematical Theory of L Systems},
Year = {1980}}
@book{RozSal2,
Address = {Secaucus, NJ, USA},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Editor = {Rozenberg,, Grzegorz and Salomaa,, Arto},
Isbn = {0387553207},
Publisher = {Springer-Verlag New York, Inc.},
Title = {Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology},
Year = {2001}}
@manual{sage,
Author = {W.\thinspace{}A. Stein and others},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Key = {Sage},
Note = {{\tt http://www.sagemath.org}},
Organization = {The Sage Development Team},
Title = {{S}age {M}athematics {S}oftware ({V}ersion 4.6.2)},
Year = {2011}}
@article{Sieben08,
Author = {N\'andor Sieben},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {European Journal of Combinatorics},
Number = {1},
Pages = {108--117},
Title = {Polyominoes with minimum site-perimeter and full set achievement games},
Volume = {29},
Year = {2008}}
@book{stan,
Address = {Cambridge},
Author = {R. P. Stanley},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Publisher = {Cambridge University Press},
Title = {Enumerative Combinatorics},
Year = {1999}}
@article{steinhaus,
Author = {H. Steinhaus},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Journal = {Colloq. Math.},
Pages = {1--13},
Title = {Length, shape and area},
Volume = {3},
Year = {1954}}
@webpage{tos10,
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Lastchecked = {Wednesday, June 8, 2011},
Title = {Animal enumerations on the {4,4} Euclidean tiling},
Url = {http://www.ieeta.pt/~tos/animals/a44.html},
Bdsk-Url-1 = {http://www.ieeta.pt/~tos/animals/a44.html}}
@inproceedings{Vi,
Author = {X. G. Viennot},
Booktitle = {S\'eries formelles et combinatoires alg\'ebrique, 4th International Conference, Montr\'eal, June 15-19, 1992},
Date-Added = {2015-05-07 14:10:46 +0000},
Date-Modified = {2015-05-07 14:10:46 +0000},
Editor = {P.~Leroux and C.~Reutenauer},
Pages = {399--420},
Publisher = {Springer},
Series = {Publications du LACIM},
Title = {A Survey of Polyomino enumeration},
Volume = {11},
Year = {1992}}
@inproceedings{Aberkane,
Author = {Ali Aberkane and Sre\v{c}ko Brlek},
Booktitle = {Actes des Journ{\'e}es Montoises d'Informatique Th{\'e}orique},
Pages = {85-89},
Title = {Suites de m{\^e}me complexit{\'e} que celle de Thue-Morse},
Year = {2002}}
@electronic{Akalin,
Author = {Fred Akalin.},
Howpublished = {Website},
Language = {English},
Month = {November},
Title = {Finding the Longest Palindromic Substring in Linear Time},
Url = {http://www.akalin.cx/longest-palindrome-linear-time},
Year = {2007},
Bdsk-Url-1 = {http://www.akalin.cx/longest-palindrome-linear-time}}
@article{Al,
Author = {{Allouche}, J.-P.},
Journal = {Journal of Mathematical Physics},
Month = apr,
Pages = {1843-1848},
Title = {{Schr{\"o}dinger operators with Rudin-Shapiro potentials are not palindromic}},
Volume = {38},
Year = {1997}}
@article{abcd,
Author = {Jean-Paul Allouche and Michael Baake and Julien Cassaigne and David Damanik},
Journal = {Theoretical Computer Science},
Number = {1},
Pages = {9-31},
Title = {Palindrome complexity},
Volume = {292},
Year = {2003}}
@article{AlSh,
Author = {Jean-Paul Allouche and Jeffrey Shallit},
Journal = {Discrete Mathematics {\&} Theoretical Computer Science},
Number = {1},
Pages = {1-10},
Title = {Sums of Digits, Overlaps, and Palindromes},
Volume = {4},
Year = {2000}}
@book{AlShLivre,
Author = {Allouche, Jean-Paul and Shallit, Jeffrey},
Pages = {571},
Publisher = {Cambridge University Press},
Subtitle = {Theory, applications, generalizations},
Title = {Automatic sequences},
Year = {2003}}
@article{Ba,
Author = {Baake, Michael},
Doi = {10.1023/A:1007678316583},
Journal = {Letters in Mathematical Physics},
Language = {English},
Number = {3},
Pages = {217-227},
Publisher = {Kluwer Academic Publishers},
Title = {A Note on Palindromicity},
Volume = {49},
Year = {1999},
Bdsk-Url-1 = {http://dx.doi.org/10.1023/A:1007678316583}}
@article{BaMBM,
Author = {Axel Bacher and Mireille Bousquet-M{\'e}lou},
Doi = {http://dx.doi.org/10.1016/j.jcta.2011.06.001},
Issn = {0097-3165},
Journal = {Journal of Combinatorial Theory, Series A},
Keywords = {Enumeration},
Number = {8},
Pages = {2365 - 2391},
Title = {Weakly directed self-avoiding walks},
Url = {http://www.sciencedirect.com/science/article/pii/S0097316511001002},
Volume = {118},
Year = {2011},
Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0097316511001002},
Bdsk-Url-2 = {http://dx.doi.org/10.1016/j.jcta.2011.06.001}}
@article{BaMaPe,
Author = {Peter Bal\'a\v{z}i and Zuzana Mas\'akov\'a and Edita Pelantov\'{a}.},
Comment = {Preuve que Tn est positif; Tnpos},
Journal = {Theoretical Computer Science},
Month = {Juin},
Number = {3},
Pages = {266-275},
Title = {Factor versus palindromic complexity of uniformly recurrent infinite words},
Volume = {380},
Year = {2007}}
@article{PrBrRe,
Author = {L'ubom\'ira Balkov\'{a} and Edita Pelantov\'{a} and \v{S}t\v{e}p\'an Starosta.},
Journal = {Theoretical Computer Science},
Pages = {120-125},
Title = {Proof of the {B}rlek-{R}eutenauer conjecture},
Volume = {475},
Year = {2013}}
@article{CorrigOnBrRe,
Author = {L'ubom\'ira Balkov\'{a} and Edita Pelantov\'{a} and \v{S}t\v{e}p\'an Starosta.},
Journal = {Theoretical Computer Science},
Month = {Septembre},
Number = {41},
Pages = {5649-5655},
Title = {Corrigendum : On {B}rlek-{R}eutenauer Conjecture.},
Volume = {412},
Year = {2011}}
@article{OnBrRe,
Author = {L'ubom\'ira Balkov\'{a} and Edita Pelantov\'{a} and \v{S}t\v{e}p\'an Starosta.},
Journal = {Theoretical Computer Science},
Number = {41},
Pages = {5649-5655},
Title = {On {B}rlek-{R}eutenauer Conjecture},