@article{Pomerance&Robson&Shallit:1997,
	key = "Pomerance, Robson, and Shallit 1997",
	author = "C. Pomerance and J. M. Robson and J. Shallit",
	title = "Automaticity {II}:  {Descriptional} complexity in the
unary case",
	journal = TCS,
	volume = 180,
	year = 1997,
	pages = "181-201",
	comment = "checked"}

@incollection{Cassaigne:1997b,
	key = "Cassaigne 1997b",
	author = "J. Cassaigne",
	title = "On a conjecture of {J. Shallit}",
	booktitle = ICALP97,
	series = LNICS,
	volume = 1256,
	year = "{\noopsort{1997b}}1997",
	pages = "693-704",
	publisher = SV,
	editor = "P. Degano and R. Gorrieri and A. Marchetti-Spaccamela"}

@article{Brzozowski:1964,
	key = "Brzozowski 1964",
	author = "J. A. Brzozowski",
	title = "Derivatives of regular expressions",
	journal = JACM,
	volume = 11,
	year = 1964,
	pages = "481-494"}

@incollection{Hopcroft:1971,
	key = "Hopcroft 1971",
	author = "J. E. Hopcroft",
	title = "An $n \log n$ algorithm for minimizing the
states in a finite automaton",
	booktitle = "The Theory of Machines and Computation",
	editor = "Z. Kohavi",
	publisher = "Academic Press",
	address = "New York",
	year = 1971,
	pages = "189-196"}

@incollection{Gabarro:1983a,
	key = "{Gabarr\'o} 1983a",
	author = "J. {Gabarr\'o}",
	title = "Initial index:  a new complexity function for languages",
	booktitle = ICALP83,
	series = LNICS,
	volume = 154,
	year = 1983,
	editor = "J. {D\'{\i}az}",
	publisher = SV,
	pages = "226-236"}

@article{Dwork&Stockmeyer:1990,
	key = "Dwork and Stockmeyer 1990",
	author = "C. Dwork and L. Stockmeyer",
	title = "A time complexity gap for two-way probabilistic
finite-state automata",
	journal = SIAMJC,
	volume = 19,
	year = 1990,
	pages = "1011-1023"}

@inproceedings{Dwork&Stockmeyer:1989,
	key = "Dwork and Stockmeyer 1989",
	author = "C. Dwork and L. Stockmeyer",
	title = "On the power of 2-way probabilistic finite state
automata",
	booktitle = FOCS89,
	publisher = IEEEPR,
	year = 1989,
	pages = "480-485"}

@article{Balcazar&Diaz&Gabarro:1985,
	key = "{Balc\'azar}, {D\'{\i}az}, and {Gabarr\'o} 1985",
	author = "J. L. {Balc\'azar} and J. {D\'{\i}az} and J. {Gabarr\'o}",
	title = "Uniform characterizations of non-uniform complexity measures",
	journal = ICTRL,
	volume = 67,
	year = 1985,
	pages = "53-89"}

@incollection{Kaneps&Freivalds:1990,
	key = "Kaneps and Freivalds 1990",
	author = "J. Kaneps and R. Freivalds",
	title = "Minimal nontrivial space complexity of 
probabilistic one-way {Turing} machines",
	booktitle = MFCS90,
	year = 1990,
	series = LNICS,
	volume = 452,
	editor = "B. Rovan",
	publisher = SV,
	pages = "355-361"}

@incollection{Kaneps&Freivalds:1991,
	key = "Kaneps and Freivalds 1991",
	author = "J. Kaneps and R. Freivalds",
	title = "Running time to recognize nonregular languages
by $2$-way probabilistic automata",
	booktitle = ICALP91,
	year = 1991,
	series = LNICS,
	volume = 510,
	editor = "J. {Leach Albert} and B. Monien and
M. {Rodr\'\i guez Artalejo}",
	publisher = SV,
	pages = "174-185"}

@incollection{Berstel:1986,
	key = "Berstel 1986",
	author = "J. Berstel",
	title = "Fibonacci words---a survey",
	booktitle = "The Book of L",
	editor = "G. Rozenberg and A. Salomaa",
	publisher = SV,
	year = 1986,
	pages = "13-27"}

@incollection{Berstel:1980,
	key = "Berstel 1980",
	author = "J. Berstel",
	title = "Mots de {Fibonacci}",
	booktitle = "S\'eminaire d'Informatique Th\'eorique",
	publisher = "Laboratoire Informatique Th\'eorique, Institut Henri Poincar\'e",
	year = "1980/81",
	pages = "57-78"}

@article{Serna:1989,
	key = "Serna 1989",
	author = "M. J. Serna",
	title = "Asymptotical behaviour of some non-uniform
measures",
	journal = RAIRO,
	volume = 23,
	year = 1989,
	pages = "281-293"}

@article{Bucher&Maurer&Culik&Wotschke:1981,
	key = "Bucher, Maurer, Culik, and Wotschke 1981",
	author = "W. Bucher and H. A. Maurer and K. Culik {II} and D. Wotschke",
	title = "Concise description of finite languages",
	journal = TCS,
	volume = 14,
	year = 1981,
	pages = "227-246"}

@article{Boasson&Courcelle&Nivat:1981,
	key = "Boasson, Courcelle, and Nivat 1981",
	author = "L. Boasson and B. Courcelle and M. Nivat",
	title = "The rational index:  a complexity measure for languages",
	journal = SIAMJC,
	volume = 10,
	year = 1981,
	pages = "284-296"}

@incollection{Goodrich&Ladner&Fischer:1977,
	key = "Goodrich, Ladner, and Fischer 1977",
	author = "G. Goodrich and R. Ladner and M. Fischer",
	title = "Straight-line programs to compute finite languages",
	booktitle = "Proceedings of A Conference on Theoretical Computer Science",
	publisher = "University of Waterloo",
	address = "Waterloo, Canada",
	year = 1977,
	pages = "221-229"}

@article{Shannon:1949,
	key = "Shannon 1949",
	author = "C. E. Shannon",
	title = "The synthesis of two-terminal switching circuits",
	journal = BSTJ,
	volume = 28,
	year = 1949,
	pages = "59-98"}

@article{Lupanov:1958,
	key = "Lupanov 1958",
	author = "O. B. Lupanov",
	title = "A method of circuit synthesis",
	journal = "Izvestia V.U.Z. Radiofizika",
	volume = 1,
	year = 1958,
	pages = "120-140"}

@incollection{Li&Vitanyi:1990,
	author = "M. Li and P. M. B. {Vit\'anyi}",
	title = "Kolmogorov complexity and its applications",
	booktitle = "Handbook of Theoretical Computer Science",
	volume = "A:  Algorithms and Complexity",
	editor = "Leeuwen, J. van",
	publisher = "MIT Press",
	year = 1990,
	pages = "187-254"}

@book{Feller:1957,
	author = "W. Feller",
	title = "An Introduction to Probability Theory and its Applications",
	publisher = "John Wiley \& Sons",
	address = "New York",
	year = 1957,
	volume = "I"}

@article{Gries:1973,
	author = "D. Gries",
	title = "Describing an algorithm by {Hopcroft}",
	journal = "Acta Informatica",
	volume = 2,
	year = 1973,
	pages = "97-109"}

@phdthesis{Gabarro:1983b,
	key = "{Gabarr\'o} 1983b",
	author = "J. {Gabarr\'o}",
	title = "Funciones de complejidad y su relaci\'on con las
familias abstractas de lenguajes",
	school = "Facultdad de Informatica, Universidad Politecnica 
de Barcelona",
	year = 1983,
	note = "In Spanish"}

@article{Paredaens&Vyncke:1977,
	key = "Paredaens and Vyncke 1977",
	author = "J. Paredaens and R. Vyncke",
	title = "A class of measures on formal langauges",
	journal = "Acta Informatica",
	volume = 9,
	year = 1977,
	pages = "73-86"}

@book{Balcazar&Diaz&Gabarro:1988,
	author = "J. L. {Balc\'azar} and J. {D\'{\i}az} and J. {Gabarr\'o}",
	title = "Structural Complexity I",
	publisher = SV,
	series = "EATCS Monographs on Theoretical Computer Science",
	volume = 11,
	year = 1988}

@article{Jiang&McDowell&Ravikumar:1991,
	key = "Jiang, McDowell, and Ravikumar 1991",
	author = "T. Jiang and E. McDowell and B. Ravikumar",
	title = "The structure and complexity of minimal {NFA's}
over a unary alphabet",
	journal = "Int. J. Found. Comp. Sci.",
	volume = 2,
	year = 1991,
	pages = "163-182"}

@article{Jiang&Ravikumar:1991,
	key = "Jiang and Ravikumar 1991",
	author = "T. Jiang and B. Ravikumar",
	title = "A note on the space complexity of some
decision problems for finite automata",
	journal = IPL,
	volume = 40,
	year = 1991,
	pages = "25-31"}

@article{Jiang&Ravikumar:1993,
	key = "Jiang and Ravikumar 1993",
	author = "T. Jiang and B. Ravikumar",
	title = "{NFA} minimization problems are hard",
	journal = SIAMJC,
	volume = 22,
	year = 1993,
	pages = "1117-1141"}

@article{Brown&Davidson&Shallit:1995,
	key = "Brown, Davidson, and Shallit 1995",
	author = "D. Brown and K. Davidson and J. Shallit",
	title = "Problem 10433",
	journal = AMM,
	volume = 102,
	year = 1995,
	pages = "170",
	note = "Solutions by K. S. Kedlaya and R. Holzsager, {\bf 105} (1998),
466--468"}

@inproceedings{Condon&Hellerstein&Pottle&Wigderson:1994,
	key = "Condon, Hellerstein, Pottle, and Wigderson 1994",
	author = "A. Condon and L. Hellerstein and S. Pottle and A. Wigderson",
	title = "On the power of finite automata with both nondeterministic
and probabilistic states",
	booktitle = "Proc. 26th Annual ACM Symp. Theor. Comput. (STOC)",
	year = 1994,
	pages = "676-685"}

@article{Ibarra&Ravikumar:1988,
	key = "Ibarra and Ravikumar 1988",
	author = "O. H. Ibarra and B. Ravikumar",
	title = "Sublogarithmic-space {Turing} machines, nonuniform
space complexity, and closure properties",
	journal = MST,
	volume = 21,
	year = 1988,
	pages = "1-17"}

@article{Li&Vitanyi:1995,
	key = "Li and {Vit\'anyi} 1995",
	author = "M. Li and P. M. B. {Vit\'anyi}",
	title = "A new approach to formal language theory by {Kolmogorov}
complexity",
	journal = SIAMJC,
	volume = 24,
	year = 1995,
	pages = "398-410"}

@article{Trakhtenbrot:1964,
	key = "Trakhtenbrot 1964",
	author = "B. A. Trakhtenbrot",
	title = "On an estimate for the weight of a finite tree",
	journal = SMZ,
	volume = 5,
	year = 1964,
	pages = "186-191",
	note = "In Russian"}

@book{Trakhtenbrot&Barzdin:1973,
	key = "Trakhtenbrot and Barzdin 1973",
	author = "B. A. Trakhtenbrot and Ya. M. Barzdin'",
	title = "Finite Automata:  Behavior and Synthesis",
	publisher = "North-Holland",
	address = "Amsterdam",
	year = 1973,
	series = "Fundamental Studies in Computer Science",
	volume = 1}

@phdthesis{Breitbart:1973,
	key = "Breitbart 1973",
	author = "Y. Breitbart",
	title = "Complexity of the calculation of predicates by
finite automata",
	school = "Technion",
	address = "Haifa, Israel",
	month = "June",
	year = 1973}

@article{Breitbart:1971,
	key = "Breitbart 1971",
	author = "Y. Breitbart",
	title = "On automaton and ``zone'' complexity of the predicate
``to be a $k$th power of an integer''",
	journal = DAN,
	volume = 196,
	year = 1971,
	pages = "16-19",
	note = "In Russian.  English translation in {\it Soviet Math.\ Dokl.}
{\bf 12} (1971), 10--14"}

@article{Grinberg&Korshunov:1966,
	key = "Grinberg and Korshunov 1966",
	author = "V. S. Grinberg and A. D. Korshunov",
	title = "Asymptotic behavior of the maximum of the weight of
a finite tree",
	journal = PPI,
	volume = 2,
	year = 1966,
	pages = "96-99",
	note = "In Russian.  English translation in
{\it Problems of Information Transmission} {\bf 2} (1966),
75--78"}

@article{Karp:1967,
	key = "Karp 1967",
	author = "R. M. Karp",
	title = "Some bounds on the storage requirements of
sequential machines and {Turing} machines",
	journal = JACM,
	volume = 14,
	year = 1967,
	pages = "478-489"}

@book{Li&Vitanyi:1993,
	key = "Li and {Vit\'anyi} 1993",
	author = "M. Li and P. {Vit\'anyi}",
	title = "An Introduction to Kolmogorov Complexity and Its Applications",
	publisher = SV,
	address = "New York",
	year = 1993}

@article{Breitbart:1976,
	key = "Breitbart 1976",
	author = "Y. Breitbart",
	title = "Some bounds on the complexity of predicate
recognition by finite automata",
	journal = JCSS,
	volume = 12,
	year = 1976,
	pages = "336-349"}

@article{Abramson&Breitbart&Lewis:1980,
	key = "Abramson, Breitbart, and Lewis 1980",
	author = "F. G. Abramson and Y. Breitbart and F. D. Lewis",
	title = "Complex properties of grammars",
	journal = JACM,
	volume = 27,
	year = 1980,
	pages = "484-498"}

@article{Rosser&Schoenfeld:1962,
	key = "Rosser and Schoenfeld 1962",
	author = "J. B. Rosser and L. Schoenfeld",
	title = "Approximate formulas for some functions of prime numbers",
	journal = "Ill. J. Math.",
	volume = 6,
	year = 1962,
	pages = "64-94"}

@book{Bach&Shallit:1996,
	key = "Bach and Shallit 1996",
	author = "E. Bach and J. Shallit",
	title = "Algorithmic Number Theory",
	publisher = "MIT Press",
	year = 1996}

@misc{Breitbart:1970,
	key = "Breitbart 1970",
	author = "Y. Breitbart",
	title = "Realization of boolean functions by finite automata",
	note = "{\it NTL (Novosti Technicheskoi Literature), Seria Automatica,
Telemechanika i Priborostroenie} No.~4 (1970)"}

@article{Takaoka:1978,
	key = "Takaoka 1978",
	author = "T. Takaoka",
	title = "A definition of measures over language space",
	journal = JCSS,
	volume = 17,
	year = 1978,
	pages = "376-387"}

@incollection{Moore:1956,
	key = "Moore 1956",
	author = "E. F. Moore",
	title = "Gedanken-experiments on sequential machines",
	booktitle = "Automata Studies",
	editor = "C. E. Shannon and J. McCarthy",
	series = "Annals of Mathematics Studies",
	volume = 34,
	publisher = PUP,
	address = "Princeton",
	year = 1956,
	pages = "129-153"}

@article{Kuzmin:1965,
	key = "Kuzmin 1965",
	author = "V. A. {Kuz'min}",
	title = "Realization of functions of the algebra of logic by means
of automata, normal algorithms, and {Turing} machines",
	journal = PK,
	volume = 13,
	pages = "75-96",
	year = 1965,
	note = "In Russian"}

@article{Liskovets:1969,
	key = "Liskovets 1969",
	author = "V. A. Liskovets",
	title = "The number of connected initial automata",
	journal = "Kibernetika",
	volume = 5,
	year = 1969,
	pages = "16-19",
	note = "In Russian.  English translation in
{\it Cybernetics} {\bf 5} (1969), 259--262"}

@article{Korshunov:1967,
	key = "Korshunov 1967",
	author = "A. D. Korshunov",
	title = "Asymptotic estimates of the number of finite automata",
	journal = "Kibernetika",
	volume = 3,
	number = 2,
	year = 1967,
	pages = "12-19",
	note = "In Russian.  English translation in
{\it Cybernetics} {\bf 3} (2) (1967), 9--14"}

@incollection{Robinson:1985,
	key = "Robinson 1985",
	author = "R. W. Robinson",
	title = "Counting strongly connected finite automata",
	booktitle = "Graph Theory with Applications to Algorithms and
Computer Science",
	editor = "Y. Alavi and G. Chartrand and L. Lesniak and D. R. Lick and
C. E. Wall",
	publisher = "John Wiley \& Sons",
	address = "New York",
	year = 1985,
	pages = "671-685"}

@article{Harrison:1965,
	key = "Harrison 1965",
	author = "M. A. Harrison",
	title = "A census of finite automata",
	journal = CJM,
	volume = 17,
	year = 1965,
	pages = "100-113"}

@article{Chrobak:1986,
	key = "Chrobak 1986",
	author = "M. Chrobak",
	title = "Finite automata and unary languages",
	journal = TCS,
	volume = 47,
	year = 1986,
	pages = "149-158"}

@incollection{Mandl:1973,
	key = "Mandl 1973",
	author = "R. Mandl",
	title = "Precise bounds associated with the subset construction
on various classes of nondeterministic finite automata",
	booktitle = "Proc. 7th Princeton Conference on Information and System
Sciences",
	year = 1973,
	pages = "263-267"}

@article{Bach:1990,
	key = "Bach 1990",
	author = "E. Bach",
	title = "Explicit bounds for primality testing and related problems",
	journal = MC,
	volume = 55,
	year = 1990,
	pages = "355-380"}

@article{Bach&Huelsbergen:1993,
	key = "Bach and Huelsbergen 1993",
	author = "E. Bach and L. Huelsbergen",
	title = "Statistical evidence for small generating sets",
	journal = MC,
	volume = 61,
	year = 1993,
	pages = "69-82"}

@incollection{Denes&Kim&Roush:1983,
	key = "{D\'enes}, Kim and Roush 1983",
	author = "J. {D\'enes} and K. H. Kim and F. W. Roush",
	title = "Automata on one symbol",
	booktitle = "Studies in Pure Mathematics:  To the Memory of Paul {Tur\'an}",
	publisher = "{Birkh\"auser} Verlag",
	address = "Basel",
	year = 1983,
	pages = "127-134"}

@article{Lyubich:1964a,
	key = "Lyubich 1964a",
	author = "Ju. I. Lyubich",
	title = "Estimates of the number of states that arise in the determinization
of a nondeterministic autonomous automaton",
	journal = DAN,
	volume = 155,
	year = 1964,
	pages = "41-43",
	note = "In Russian.  English translation in {\it Soviet Mathematics} {\bf 5}
(1964), 345--348"}

@article{Lyubich:1964b,
	key = "Lyubich 1964b",
	author = "Ju. I. Lyubich",
	title = "Estimates for optimal determinization of nondeterministic
autonomous automata",
	journal = SMZ,
	volume = 5,
	year = 1964,
	pages = "337-355",
	note = "In Russian"}

@article{Lyubich&Livshits:1965,
	key = "Lyubich and Livshits 1965",
	author = "Ju. I. Lyubich and E. M. Livshits",
	title = "Estimates for the weight of a regular event over a 1-letter
alphabet",
	journal = SMZ,
	volume = 6,
	year = 1965,
	pages = "122-126",
	note = "In Russian"}

@article{Alt&Mehlhorn:1975,
	key = "Alt and Mehlhorn 1975",
	author = "H. Alt and K. Mehlhorn",
	title = "A language over a one symbol alphabet requiring only
$O(\log\log n)$ space",
	journal = "SIGACT News",
	volume = 7,
	number = 4,
	year = 1975,
	pages = "31-33"}

@techreport{Schmidt:1978,
	key = "Schmidt 1978",
	author = "E. M. Schmidt",
	title = "Succinctness of descriptions of context-free, regular,
and finite languages",
	institution = "Department of Computer Science,
University of Aarhus, Denmark",
	number = "DAIMI PB-84",
	month = "January",
	year = "1978"}

@article{Glaister&Shallit:1998,
	key = "Glaister and Shallit 1998",
	author = "I. Glaister and J. O. Shallit",
	title = "Automaticity {III}:  Polynomial automaticity and
context-free languages",
	journal = CC,
	volume = 7,
	year = 1998,
	pages = "371-387"}

@inproceedings{Lang:1992,
	key = "Lang 1992",
	author = "K. J. Lang",
	title = "Random {DFA's} can be approximately learned from sparse
uniform examples",
	booktitle = "Proc. 5th Annual ACM Workshop on Computational Learning Theory",
	publisher = "ACM Press",
	year = 1992,
	pages = "45-52"}

@article{Veelenturf:1978,
	key = "Veelenturf 1978",
	author = "L. P. J. Veelenturf",
	title = "Inference of sequential machines from sample computations",
	journal = IEEE-TC,
	volume = "C-27",
	year = 1978,
	pages = "167-170"}

@incollection{Shallit&Breitbart:1994,
	key = "Shallit and Breitbart 1994",
	author = "J. O. Shallit and Y. Breitbart",
	title = "Automaticity:  properties of a 
measure of descriptional complexity",
	booktitle = STACS94,
	editor = "P. Enjalbert et al.",
	publisher = SV,
	series = LNICS,
	volume = 775,
	year = 1994,
	pages = "619-630"}

@inproceedings{Stearns&Hartmanis&Lewis:1965,
	key = "Stearns, Hartmanis, and Lewis 1965",
	author = "R. E. Stearns and J. Hartmanis and Lewis {II}, P. M.",
	title = "Hierarchies of memory limited computations",
	booktitle = "Proc. 6th Annual Symposium on Switching
Circuit Theory and Logical Design",
	year = 1965,
	pages = "179-190"}

@inproceedings{Lewis&Stearns&Hartmanis:1965,
	key = "Lewis, Stearns, and Hartmanis 1965",
	author = "Lewis {II}, P. M. and R. E. Stearns and J. Hartmanis",
	title = "Memory bounds for recognition of context-free and
context-sensitive languages",
	booktitle = "Proc. 6th Annual Symposium on Switching
Circuit Theory and Logical Design",
	year = 1965,
	pages = "191-202",
	note = "Errata, p. 190"}

@inproceedings{Meyer&Fischer:1971,
	key = "Meyer and Fischer 1971",
	author = "A. R. Meyer and M. J. Fischer",
	title = "Economy of description by automata, grammars, and formal
systems",
	booktitle = "Proc. 12th Annual Symposium on Switching and
Automata Theory",
	year = 1971,
	pages = "188-191"}

@article{Moore:1971,
	key = "Moore 1971",
	author = "F. R. Moore",
	title = "On the bounds for state-set size in the proofs of equivalence
between deterministic, nondeterministic, and two-way finite automata",
	journal = IEEE-TC,
	volume = 20,
	year = 1971,
	pages = "1211-1214"}

@article{Angluin:1978,
	key = "Angluin 1978",
	author = "D. Angluin",
	title = "On the complexity of minimum inference of regular sets",
	journal = ICTRL,
	volume = 39,
	year = 1978,
	pages = "337-350"}

@article{Champarnaud&Pin:1989,
	key = "Champarnaud and Pin 1989",
	author = "J.-M. Champarnaud and J.-E. Pin",
	title = "A maximin problem on finite automata",
	journal = DAM,
	volume = 23,
	year = 1989,
	pages = "91-96"}

@article{Breitbart&Kozmidiadi:1969,
	key = "Breitbart and Komidiadi 1969",
	author = "Y. Breitbart and V. A. Kozmidiadi",
	title = "Two subclasses of {Turing} machines reducible to
finite automata",
	journal = DAN,
	volume = 187,
	year = 1969,
	pages = "9-10",
	note = "In Russian.  English translation in
{\it Soviet Math.\ Dokl.} {\bf 10} (1969), 763--764"}

@article{Breitbart&Kozmidiadi:1972,
	key = "Breitbart and Kozmidiadi 1972",
	author = "Y. Breitbart and V. A. Kozmidiadi",
	title = "Subclasses of {Turing} machines reducible to finite
automata",
	journal = "Kibernetika",
	volume = 8,
	number = 1,
	year = 1972,
	pages = "31-41",
	note = "In Russian.  English translation in
{\it Cybernetics} {\bf 8} (1972), 32--43"}

@article{Shallit&Breitbart:1996,
	key = "Shallit and Breitbart 1996",
	author = "J. O. Shallit and Y. Breitbart",
	title = "Automaticity {I}:  {Properties} of a measure of descriptional complexity",
	journal = JCSS,
	volume = 53,
	year = 1996,
	pages = "10-25"}
	
@article{Condon&Hellerstein&Pottle&Wigderson:1998,
	key = "Condon, Hellerstein, Pottle, and Wigderson 1998",
	author = "A. Condon and L. Hellerstein and S. Pottle and A. Wigderson",
	title = "On the power of finite automata with both nondeterministic
and probabilistic states",
	journal = SIAMJC,
	volume = 27,
	year = 1998,
	pages = "739-762"}

@article{Shallit:1996,
	key = "Shallit 1996",
	author = "J. O. Shallit",
	title = "Automaticity {IV}:  Sequences, sets, and diversity",
	journal = JTNB,
	volume = 8,
	year = 1996,
	pages = "347-367"}

@article{Chytil:1986,
	key = "Chytil 1986",
	author = "M. P. Chytil",
	title = "Almost context-free languages",
	journal = FI,
	volume = 9,
	year = 1986,
	pages = "283-322"}

@article{Shallit:2000,
	key = "Shallit 2000",
	author = "J. O. Shallit",
	title = "Automaticity and rationality",
	journal = JALC,
	volume = 5,
	year = 2000,
	pages = "255-268"}