J. Abrahams, Huffman-type codes for infinite source distributions, Journal of the Franklin Institute, vol.331, issue.3, pp.265-271, 1994.
DOI : 10.1016/0016-0032(94)90099-X

J. Abrahams, Code and parse trees for lossless source encoding, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), pp.113-146, 2001.
DOI : 10.1109/SEQUEN.1997.666911

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. L. Adler, D. Coppersmith, and M. Hassner, Algorithms for sliding block codes, IEEE Trans. Inform. Theory, IT, pp.29-34, 1983.

S. Akiyama, Cubic Pisot units with finite beta expansions, Algebraic Number Theory and Diophantine Analysis, pp.11-26, 2000.
DOI : 10.1515/9783110801958.11

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Akiyama, F. Bassino, and C. Frougny, Automata for Arithmetic Meyer Sets, Lect. Notes Comput. Sci, vol.2976, pp.252-261, 2004.
DOI : 10.1007/978-3-540-24698-5_29

URL : https://hal.archives-ouvertes.fr/hal-00159713

S. Akiyama, F. Bassino, and C. Frougny, Arithmetic Meyer sets and finite automata, Information and Computation, vol.201, issue.2, pp.199-215, 2005.
DOI : 10.1016/j.ic.2005.05.002

URL : https://hal.archives-ouvertes.fr/hal-00159675

R. B. Ash, Information theory, 1990.

D. Barache, B. Champagne, and J. Gazeau, Pisot-cyclotomic quasilattices and their symmetry semigroups, pp.15-66, 1998.
DOI : 10.1090/fim/010/02

F. Bassino, M. Béal, and D. Perrin, Enumerative sequences of leaves in rational trees, ICALP'97, pp.76-86, 1997.
DOI : 10.1007/3-540-63165-8_166

URL : https://hal.archives-ouvertes.fr/hal-00619864

F. Bassino, M. Béal, and D. Perrin, Super-state automata and rational trees, Lect. Notes Comput. Sci, vol.1380, pp.42-52, 1998.
DOI : 10.1007/BFb0054309

URL : https://hal.archives-ouvertes.fr/hal-00619862

F. Bassino, M. Béal, and D. Perrin, Enumerative sequences of leaves and nodes in rational trees, Theoretical Computer Science, vol.221, issue.1-2, pp.41-60, 1999.
DOI : 10.1016/S0304-3975(99)00026-2

URL : https://hal.archives-ouvertes.fr/hal-00619336

F. Bassino, M. Béal, and D. Perrin, A Finite State Version of the Kraft--McMillan Theorem, SIAM Journal on Computing, vol.30, issue.4, pp.1211-1230, 2000.
DOI : 10.1137/S0097539798343908

URL : https://hal.archives-ouvertes.fr/hal-00619334

F. Bassino, M. Béal, and D. Perrin, Length distributions and regular sequences, In Codes, Systems and Graphical Models, the series IMA Volumes in Mathematics and its Applications, pp.415-438, 2001.

F. Bassino, Beta-Expansions for Cubic Pisot Numbers, Lect. Notes Comput. Sci, pp.141-152, 2002.
DOI : 10.1007/3-540-45995-2_17

URL : https://hal.archives-ouvertes.fr/hal-00619858

F. Bassino and J. Clément, Optimal codes for regular sources, en préparation

F. Bassino, J. Clément, and C. Nicaud, The Average Lengths of the Factors of the Standard Factorization of Lyndon Words, Lect. Notes Comput. Sci, vol.2450, pp.307-318, 2003.
DOI : 10.1007/3-540-45005-X_27

URL : https://hal.archives-ouvertes.fr/hal-00619865

F. Bassino, J. Clément, and C. Nicaud, Lyndon words with a fixed standard right factor, SODA'04, pp.646-647, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00619866

F. Bassino, J. Clément, and C. Nicaud, The standard factorization of Lyndon words: an average point of view, Discrete Mathematics, vol.290, issue.1, pp.290-291, 2005.
DOI : 10.1016/j.disc.2004.11.002

URL : https://hal.archives-ouvertes.fr/hal-00619337

F. Bassino, J. Clément, G. Seroussi, and A. Viola, Optimal prefix codes for families of two-dimensional geometric distributions, nov, 2005.

F. Bassino and C. Nicaud, Enumeration and random generation of accessible automata, nov, 2005.

M. Béal and D. Perrin, Symbolic dynamics and finite automata, in Handbook of Formal Languages, 1997.

M. Béal and D. Perrin, symbols, Journal of the ACM, vol.50, issue.6, pp.6-955, 2003.
DOI : 10.1145/950620.950625

D. Beauquier, Minimal automation for a factorial, transitive, and rational language, Theoretical Computer Science, vol.67, issue.1, pp.65-73, 1989.
DOI : 10.1016/0304-3975(89)90022-4

J. Bernat, Computation of L ? for several cubic Pisot numbers, J. Autom. Lang. Comb
URL : https://hal.archives-ouvertes.fr/hal-00966525

J. Bernat, Arithmetics in ?-numeration
URL : https://hal.archives-ouvertes.fr/hal-00966511

O. Bernardi, A note on Stirling numbers, preprint

J. Berstel and L. Boasson, The set of Lyndon words is not context-free, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, vol.63, pp.139-140, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00619462

J. Berstel and D. Perrin, The beginning of combinatorics on words, European Journal of Combinatorics

J. Berstel and M. Pocchiola, Average cost of Duval's algorithm for generating Lyndon words, Theoretical Computer Science, vol.132, issue.1-2, pp.415-425, 1994.
DOI : 10.1016/0304-3975(94)00013-1

J. Berstel and D. Perrin, Theory of codes, 1985.
URL : https://hal.archives-ouvertes.fr/hal-00619780

J. Berstel, . Ch, and . Reutenauer, Rational series and their languages, 1988.
DOI : 10.1007/978-3-642-73235-5

URL : https://hal.archives-ouvertes.fr/hal-00619791

A. Bertrand, Développements en base de Pisot et répartition modulo 1, C. R. Acad. Sci. Paris, pp.285-419, 1977.

A. Bertrand-mathis, Développement en base ?, répartition modulo 1 de la suite (x? n ) n?0 , langages codés et ?-shift, pp.271-323, 1986.

F. Blanchard, ??-Expansions and symbolic dynamics, Theoretical Computer Science, vol.65, issue.2, pp.131-141, 1989.
DOI : 10.1016/0304-3975(89)90038-8

F. Blanchard and G. , Languages and subshifts, Automata on Infinite Words, pp.138-146, 1985.
DOI : 10.1007/3-540-15641-0_30

F. Blanchard and G. , Syst??mes cod??s, Theoretical Computer Science, vol.44, pp.17-49, 1986.
DOI : 10.1016/0304-3975(86)90108-8

M. Bousquet-mélou, Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages, STACS 2005, pp.18-35, 2005.
DOI : 10.1007/978-3-540-31856-9_2

D. W. Boyd, Salem numbers of degree four have periodic expansions, Number theory, pp.57-64, 1989.
DOI : 10.1515/9783110852790.57

D. W. Boyd, On beta expansions for Pisot numbers, Mathematics of Computation, vol.65, issue.214, pp.214-841, 1996.
DOI : 10.1090/S0025-5718-96-00693-X

D. W. Boyd, On the beta expansion for Salem numbers of degree 6, Mathematics of Computation, vol.65, issue.214, pp.214-861, 1996.
DOI : 10.1090/S0025-5718-96-00700-4

?. C. Burdík, C. Frougny, J. Gazeau, and R. Krejcar, Beta-integers as natural counting systems for quasicrystals, Journal of Physics A: Mathematical and General, vol.31, issue.30, pp.31-6449, 1998.
DOI : 10.1088/0305-4470/31/30/011

K. Chen, R. Fox, and R. Lyndon, Free differential calculus IV : The quotient groups of the lower central series, Ann. Math, vol.58, pp.81-95, 1958.

T. M. Cover and J. A. Thomas, Information Theory, 1991.
DOI : 10.1201/9781420049763.ch73

N. G. De-bruijn, Asymptotic method in analysis, 1961.

J. Champarnaud and T. Paranthoën, Random generation of DFAs, Theoretical Computer Science, vol.330, issue.2, pp.221-235, 2005.
DOI : 10.1016/j.tcs.2004.03.072

B. N. Delone, Neue darstellung der geometrischen kristallographie, Zeit. Kristallographie, vol.84, pp.109-149, 1932.

A. Denise and P. Zimmermann, Uniform random generation of decomposable structures using floating-point arithmetic, Theoretical Computer Science, vol.218, issue.2, pp.233-248, 1999.
DOI : 10.1016/S0304-3975(98)00323-5

URL : https://hal.archives-ouvertes.fr/inria-00073447

M. Denker, C. Grillenberger, and K. , Sigmund Ergodic theory on comact spaces, Lect. Notes Math, vol.527, 1976.

M. Domaratzki, D. Kisman, and J. Shallit, On the number of distinct languages accepted by finite automata with n states, J. Autom. Lang. Comb, issue.4, pp.469-486, 2002.

P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer, Random generation of combinatorial structures: Boltzmann samplers and beyond, Proceedings of the 2011 Winter Simulation Conference (WSC), pp.577-625, 2004.
DOI : 10.1109/WSC.2011.6147745

URL : https://hal.archives-ouvertes.fr/hal-00654267

J. Duval, Factorizing words over an ordered alphabet, Journal of Algorithms, vol.4, issue.4, pp.363-381, 1983.
DOI : 10.1016/0196-6774(83)90017-2

A. Elkharrat, C. Frougny, J. P. Gazeau, and J. , Verger-Gaugry, Symmetry groups for beta-lattices, Theoret. Comput. Sci, pp.319-281, 2004.

V. Elser, Indexing problems in quasicrystal diffraction, Physical Review B, vol.32, issue.8, pp.32-4892, 1985.
DOI : 10.1103/PhysRevB.32.4892

W. Feller, An introduction to probability theory and its applications, 1968.

P. Flajolet, X. Gourdon, and D. Panario, The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields, Journal of Algorithms, vol.40, issue.1, pp.40-77, 2001.
DOI : 10.1006/jagm.2001.1158

URL : https://hal.archives-ouvertes.fr/inria-00073319

P. Flajolet and R. Sedgewick, Analytic combinatorics, Book in pre- paration, (672p.+x. Version of, 2005.

P. Flajolet and R. Sedgewick, An introduction to the analysis of algorithms, 1996.

P. Flajolet and M. Soria, The Cycle Construction, SIAM Journal on Discrete Mathematics, vol.4, issue.1, pp.58-60, 1991.
DOI : 10.1137/0404006

P. Flajolet, P. Zimmermann, and B. , A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
DOI : 10.1016/0304-3975(94)90226-7

URL : https://hal.archives-ouvertes.fr/hal-00917729

L. Flatto, J. Lagarias, and B. Poonen, The zeta function of the beta transformation, Ergodic Theory and Dynamical Systems, vol.135, issue.02, pp.237-266, 1994.
DOI : 10.1007/BF01897025

H. Fredricksen and J. Maiorana, Necklaces of beads in k colors and k-ary de Bruijn sequences, Discrete Math, vol.23, pp.3-207, 1978.

C. Frougny, Number representation and finite automata, Math. Systems Theory, vol.25, pp.37-60, 1992.
DOI : 10.1017/CBO9780511777653.003

C. Frougny, J. Gazeau, and R. Krejcar, Additive and multiplicative properties of point sets based on beta-integers, Theoretical Computer Science, vol.303, issue.2-3, pp.491-516, 2003.
DOI : 10.1016/S0304-3975(02)00503-0

URL : https://hal.archives-ouvertes.fr/hal-00159704

C. Frougny and B. Solomyak, Finite beta-expansions, Ergodic Theory and Dynamical Systems, vol.1294, issue.04, pp.713-723, 1992.
DOI : 10.1112/blms/12.4.269

F. Gähler and J. Rhyner, Equivalence of the generalised grid and projection methods for the construction of quasiperiodic tilings, Journal of Physics A: Mathematical and General, vol.19, issue.2, pp.267-277, 1986.
DOI : 10.1088/0305-4470/19/2/020

R. G. Gallager, Variations on a theme by Huffman, IEEE Transactions on Information Theory, vol.24, issue.6, pp.24-668, 1978.
DOI : 10.1109/TIT.1978.1055959

R. G. Gallager and D. C. , Van Voorhis, Optimal source codes for geometrically distributed integer alphabets, IEEE Trans.Inform. Theory, pp.228-230, 1975.

F. R. Gantmatcher, Matrix theory, volume II, 1960.

N. Gjini, Beta-expansion of 1 for quartic Pisot units, Periodica Mathematica Hungarica, vol.47, issue.1/2, pp.73-87, 2003.
DOI : 10.1023/B:MAHU.0000010812.23226.b0

M. J. Golin, A combinatorial approach to Golomb forests, Theoretical Computer Science, vol.263, issue.1-2, pp.283-304, 2001.
DOI : 10.1016/S0304-3975(00)00250-4

S. W. Golomb, Run length encodings, IEEE Trans. Inform. Theory, IT, pp.12-399, 1966.

S. Golomb, Irreducible polynomials, synchronizing codes, primitive necklaces and cyclotomic algebra, Proc. Conf Combinatorial Math. and Its Appl, pp.358-370, 1969.

I. Good, An Asymptotic Formula for the Differences of the Powers at Zero, The Annals of Mathematical Statistics, vol.32, issue.1, pp.249-256, 1961.
DOI : 10.1214/aoms/1177705156

L. S. Guimond, Z. Masáková, and E. Pelantová, Arithmetics of beta-expansions, Acta Arithmetica, vol.112, issue.1, pp.23-40, 2004.
DOI : 10.4064/aa112-1-2

D. E. Handelman, Spectral radii of primitive integral companion matrices and log concave polynomials, Symbolic Dynamic and its Applications, pp.231-238, 1992.
DOI : 10.1090/conm/135/1185092

F. Harary, Unsolved problems in the enumeration of graphs, Magyar Tud, Akad. Math. Kutató Int. Közl, vol.5, pp.63-95, 1960.

M. A. Harrison, A census of finite automata, Journal canadien de math??matiques, vol.17, issue.0, pp.100-113, 1965.
DOI : 10.4153/CJM-1965-010-9

J. E. Hopcroft and J. Ullman, Introduction to automata theory, languages, and computation, 1980.
DOI : 10.1145/568438.568455

D. A. Huffman, A method for the construction of minimum-redundancy codes, Proceedings of the IRE, pp.1098-1101, 1952.

P. A. Humblet, Optimal source coding for a class of integer alphabets (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.1, pp.24-110, 1978.
DOI : 10.1109/TIT.1978.1055813

S. Ito and Y. Takahashi, Markov subshifts and realization of $\beta$ -expansions, Journal of the Mathematical Society of Japan, vol.26, issue.1, pp.33-55, 1994.
DOI : 10.2969/jmsj/02610033

T. Katayama, M. Okamoto, and H. Enomoto, Characterization of the structure-generating functions of regular sets and the DOL growth functions, Information and Control, vol.36, issue.1, pp.85-101, 1978.
DOI : 10.1016/S0019-9958(78)90247-4

K. H. Kim, F. W. Roush, and J. B. Wagoner, The shift equivalence problem, The Mathematical Intelligencer, vol.135, issue.2, pp.18-29, 1999.
DOI : 10.1007/BF03025333

B. P. Kitchens, Symbolic dynamics : one-sided, two-sided and countable state Markov shifts, 1997.
DOI : 10.1007/978-3-642-58822-8

D. Knuth, The average time for carry propagation, Indagationes Mathematicae, vol.40, pp.238-242, 1978.

D. Knuth, The art of computer programming, fascicle 2, generating all tuples and permutations, 2005.

D. Korshunov, Enumeration of finite automata, Problemy Kibernetiki, vol.34, pp.5-82, 1978.

A. D. Korshunov, On the number of non-isomorphic strongly connected finite automata, Journal of Information Processing and Cybernetics, vol.9, pp.459-462, 1986.

P. Kramer, Nonperiodic central space fillings with isocahedral symmetry using copies of seven elementary cells, pp.257-264, 1984.

P. Kramer and N. Negri, On periodic and nonperiodic space fillings of E n obtained by projection, Acta Crysta, pp.40-580, 1984.

J. C. Lagarias, Geometric Models for Quasicrystals I. Delone Sets of Finite Type, Discrete & Computational Geometry, vol.21, issue.2, pp.161-191, 1999.
DOI : 10.1007/PL00009413

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. C. Lagarias, Meyer's concept of quasicrystal and quasiregular sets, Communications in Mathematical Physics, vol.77, issue.No. 5, pp.365-376, 1996.
DOI : 10.1007/BF02102593

D. Levine and P. J. Steinhardt, Quasicrystals: A New Class of Ordered Structures, Physical Review Letters, vol.53, issue.26, pp.2477-2480, 1984.
DOI : 10.1103/PhysRevLett.53.2477

D. A. Lind, Entropies and factorizations of topological Markov shifts, Bulletin of the American Mathematical Society, vol.9, issue.2, pp.219-222, 1983.
DOI : 10.1090/S0273-0979-1983-15162-5

D. A. Lind, The entropies of topological Markov shifts and a related class of algebraic integers, Ergodic Theory and Dynamical Systems, vol.none, issue.02, pp.283-300, 1984.
DOI : 10.1007/BF01390047

D. A. Lind and B. H. Marcus, An introduction to symbolic dynamics and coding, 1995.
DOI : 10.1017/CBO9780511626302

T. Linder, V. Tarokh, and K. Zeger, Existence of optimal prefix codes for infinite source alphabets, IEEE Transactions on Information Theory, vol.43, issue.6, pp.2026-2028, 1997.
DOI : 10.1109/18.641571

V. Liskovets, The number of connected initial automata, Cybernetics, vol.5, issue.Nos. 1?2, pp.16-19, 1969.
DOI : 10.1007/BF01070908

V. A. Liskovets, Enumeration of non-isomorphic strongly connected automata , Vesci Akad, Navuk BSSR, Ser. Fiz.-Mat. Navuk, vol.3, pp.26-30, 1971.

V. A. Liskovets, Exact enumeration of acyclic automata, in FPSAC'03

M. Lothaire, Algebraic combinatorics on words, of Encyclopedia of Mathematics and its Applications, 2002.
DOI : 10.1017/CBO9781107326019

URL : https://hal.archives-ouvertes.fr/hal-00620608

M. Lothaire, Applied combinatorics on words, of Encyclopedia of Mathematics and its Applications, 2005.
DOI : 10.1017/CBO9781107341005

URL : https://hal.archives-ouvertes.fr/hal-00620607

R. Lyndon, On Burnside problem I, Trans, pp.202-215, 1954.

C. R. Maccluer, The Many Proofs and Applications of Perron's Theorem, SIAM Review, vol.42, issue.3, pp.487-498, 2000.
DOI : 10.1137/S0036144599359449

R. Marchand and E. Z. Azad, Limit law of the length of the standard right factor of a Lyndon word, arXiv :math

C. Martinez and X. Molinero, An Efficient Generic Algorithm for the Generation of Unlabelled Cycles, Mathematics and Computer Science III, Trends in Mathematics, 2004.
DOI : 10.1007/978-3-0348-7915-6_19

N. Merhav, G. Seroussi, and M. J. Weinberger, Optimal prefix codes for sources with two-sided geometric distributions, IEEE Transactions on Information Theory, vol.46, issue.1, pp.229-236, 2000.
DOI : 10.1109/18.817513

Y. Meyer, Nombres de Pisot, nombres de Salem et analyse harmonique, Lecture Notes in Math, vol.117, 1970.
DOI : 10.1007/BFb0069680

Y. Meyer, Algebraic numbers and harmonic analysis, 1972.

Y. Meyer, Quasicrystals, Diophantine approximation and algebraic numbers, LesÉditionsLes´LesÉditions de Physique, pp.1-16, 1995.
DOI : 10.1007/978-3-662-03130-8_1

R. V. Moody, Meyer sets and their duals, in The Mathematics of Long-Range Aperiodic Order, NATO ASI Series C 489, pp.403-441, 1997.

R. V. Moody, Model Sets: A Survey, From Quasicrystals to More Complex Systems, pp.145-166, 2000.
DOI : 10.1007/978-3-662-04253-3_6

A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms, 1978.

D. Panario and B. Richmond, Smallest components in decomposable structures: Exp-log class, Algorithmica, vol.14, issue.2, pp.29-205, 2001.
DOI : 10.1007/BF02679619

W. Parry, On the??-expansions of real numbers, Acta Mathematica Academiae Scientiarum Hungaricae, vol.17, issue.3-4, pp.401-416, 1960.
DOI : 10.1007/BF02020954

M. Perles, M. O. Rabin, and E. Shamir, The Theory of Definite Automata, IEEE Transactions on Electronic Computers, vol.12, issue.3, pp.12-233, 1963.
DOI : 10.1109/PGEC.1963.263534

D. Perrin, On positive matrices, Theoretical Computer Science, vol.94, issue.2, pp.357-366, 1992.
DOI : 10.1016/0304-3975(92)90043-F

D. Perrin, Enumerative combinatorics on words, Algebraic Combinatorics and Computer Science, pp.391-430, 2001.
DOI : 10.1007/978-88-470-2107-5_16

URL : https://hal.archives-ouvertes.fr/hal-01121901

C. E. Radke, Enumeration of strongly connected sequential machines, Information and Control, vol.8, issue.4, pp.377-389, 1965.
DOI : 10.1016/S0019-9958(65)90316-5

A. Rényi, Representations for real numbers and their ergodic properties, Acta Mathematica Academiae Scientiarum Hungaricae, vol.95, issue.3-4, pp.477-493, 1957.
DOI : 10.1007/BF02020331

C. Reutenauer, Free lie algebras, 1993.
DOI : 10.1016/S1570-7954(03)80075-X

R. F. Rice, Some practical universal noiseless coding techniques -Parts I- III, 1979.
DOI : 10.1117/12.958253

R. Robinson, Counting strongly connected finite automata, In Graph theory with Applications to Algorithms and Computer Science, pp.671-685, 1985.

F. Ruskey and J. Sawada, Generating Lyndon brackets : a basis for the n-th homogeneous component of the free Lie algebra, J. Algorithms, pp.46-67, 2003.

J. Sakarovitch, Eléments de théorie des automates, Vuibert English translation : Elements of automata theory, 2003.

A. Salomaa and M. Soittola, Automata theoretic properties of formal power series, 1978.

K. Schmidt, On Periodic Expansions of Pisot Numbers and Salem Numbers, Bulletin of the London Mathematical Society, vol.12, issue.4, pp.269-278, 1980.
DOI : 10.1112/blms/12.4.269

M. Senechal, Quasicrystal and geometry, 1995.

M. Soittola, Positive rational sequences, Theoretical Computer Science, vol.2, issue.3, pp.317-322, 1976.
DOI : 10.1016/0304-3975(76)90084-0

URL : http://doi.org/10.1016/0304-3975(76)90084-0

B. Solomyak, Conjugates of Beta-Numbers and the Zero-Free Domain for a Class of Analytic Functions, Proc. London Math. Soc, pp.3-477, 1994.
DOI : 10.1112/plms/s3-68.3.477

C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

V. Vyssotsky, A counting problem for finite automata, 1959.

M. J. Weinberger, G. Seroussi, and G. Sapiro, The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS, IEEE Transactions on Image Processing, vol.9, issue.8, 1998.
DOI : 10.1109/83.855427

B. Weiss, Subshifts of finite type and sofic systems, Monatshefte f???r Mathematik, vol.76, issue.5, pp.462-474, 1973.
DOI : 10.1007/BF01295322

F. Williams, Classification of subshifts of finite type, Annals of Math. Errata ibid, vol.99, pp.98-120, 1973.