Complexity function: Difference between revisions

Revision as of 19:55, 29 October 2012

Revision as of 18:29, 30 October 2012

Line 19:

==References==

{{reflist}}

* {{cite book | lastlast1=PytheasCassaigne Fogg| first1=J. | firstlast2=Nicolas | first2=NF. | otherschapter=EditorsFactor Berthé,complexity Valérie;| Ferenczi,pages=163–247 Sébastien;| Mauduit,editor1-last=Berthé Christian;| Siegel,editor1-first=Valérie A.| editor2-last=Rigo | titleeditor2-first=SubstitutionsMichel in| dynamicstitle=Combinatorics, arithmeticsautomata, and combinatoricsnumber theory | series=LectureEncyclopedia Notes inof Mathematics and its Applications | volume=1794135 | ___location=BerlinCambridge | publisher=[[Springer-VerlagCambridge University Press]] | year=20022010 | isbn=3978-5400-44141521-751597-9 | zbl=10141216.1101568204 }}

* {{cite book | last=Lothaire | first=M. | authorlink=M. Lothaire | title=Algebraic combinatorics on words | others=With preface by Jean Berstel and Dominique Perrin | edition=Reprint of the 2002 hardback | series=Encyclopedia of Mathematics and Its Applications | volume=90| publisher=Cambridge University Press | year=2011 | isbn=978-0-521-18071-9 | zbl=1221.68183 }}

* {{cite book | last=Pytheas Fogg | first=N. | others=Editors Berthé, Valérie; Ferenczi, Sébastien; Mauduit, Christian; Siegel, A. | title=Substitutions in dynamics, arithmetics and combinatorics | series=Lecture Notes in Mathematics | volume=1794 | ___location=Berlin | publisher=[[Springer-Verlag]] | year=2002 | isbn=3-540-44141-7 | zbl=1014.11015 }}

[[Category:Theoretical computer science]]