Jean Berstel (1973):
Sur la densité asymptotique de langages formels.
In: International Colloquium on Automata, Languages and Programming (ICALP, 1972).
North-Holland,
France,
pp. 345–358.
Jean Berstel & Dominique Perrin (1985):
Theory of codes.
Pure and applied mathematics.
Academic Press,
Orlando, San Diego, New York.
Jean Berstel, Dominique Perrin & Christophe Reutenauer (2009):
Codes and Automata (Encyclopedia of Mathematics and Its Applications),
1st edition.
Cambridge University Press,
New York, NY, USA.
Andreas Blass, Yuri Gurevich & Dexter Kozen (1985):
A Zero-One Law for Logic with a Fixed-Point Operator.
Information and Control 67(1-3),
pp. 70–90,
doi:10.1016/S0019-9958(85)80027-9.
Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen & Jan Schwinghammer (2004):
Efficiently Computing the Density of Regular Languages.
In: Martín Farach-Colton: LATIN 2004: Theoretical Informatics,
Lecture Notes in Computer Science 2976.
Springer Berlin Heidelberg,
pp. 262–270,
doi:10.1007/978-3-540-24698-5_30.
Volker Diekert, Paul Gastin & Manfred Kufleitner (2008):
A Survey on Small Fragments of First-Order Logic over Finite Words.
International Journal of Foundations of Computer Science 19(3),
pp. 513–548,
doi:10.1142/S0129054108005802.
Samuel Eilenberg & Bret Tilson (1976):
Automata, languages and machines. Volume B.
Pure and applied mathematics.
Academic Press,
New-York, San Franciso, London.
Ronald Fagin (1976):
Probabilities on Finite Models.
J. Symb. Log. 41(1),
pp. 50–58,
doi:10.1017/S0022481200051756.
Philippe Flajolet & Robert Sedgewick (2009):
Analytic Combinatorics,
1 edition.
Cambridge University Press,
New York, NY, USA,
doi:10.1017/CBO9780511801655.
Ulf Grenander (1963):
Probabilities on algebraic structures.
Wiley,
New York.
Leonid Libkin (2004):
Elements of Finite Model Theory.
SpringerVerlag,
doi:10.1007/978-3-662-07003-1.
Per Martin-Löf (1965):
Probability theory on discrete semigroups.
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 4(1),
pp. 78–102,
doi:10.1007/BF00535486.
Igor Rystsov (1997):
Reset words for commutative and solvable automata.
Theoretical Computer Science 172(1–2),
pp. 273 – 279,
doi:10.1016/S0304-3975(96)00136-3.
Jacques Sakarovitch (2009):
Elements of Automata Theory.
Cambridge University Press,
New York, NY, USA,
doi:10.1017/CBO9781139195218.
Arto Salomaa & M. Soittola (1978):
Automata Theoretic Aspects of Formal Power Series.
Springer-Verlag New York, Inc.,
Secaucus, NJ, USA,
doi:10.1007/978-1-4612-6264-0.