Alfred V. Aho, Ravi Sethi & Jeffrey D. Ullman (1985):
Compilers: Principles, Techniques, and Tools.
Addison-Wesley.
Alfred V. Aho & Jeffrey D. Ullman (1992):
Foundations of Computer Science.
W.H. Freeman.
Jürgen Albert & Jarkko Kari (2009):
Digital Image Compression.
In: Handbook of Weighted Automata, chapter 11,
pp. 453–479,
doi:10.1007/978-3-642-01492-5_11.
Paolo Aluffi (2009):
Algebra: Chapter 0.
Graduate Studies in Mathematics 104.
American Mathematical Society,
doi:10.1090/gsm/104/01.
Michael F. Atiyah & Ian G. MacDonald (1994):
Introduction To Commutative Algebra.
Addison-Wesley Series in Mathematics.
Avalon Publishing.
Jean-Michel Autebert, Jean Berstel & Luc Boasson (1997):
Context-free Languages and Pushdown Automata.
In: Grzegorz Rozenberg & Arto Salomaa: Handbook of Formal Languages, chapter 3 1.
Springer,
pp. 111–174,
doi:10.1007/978-3-642-59136-5_3.
Christel Baier, Marcus Größer & Frank Ciesinski (2009):
Model Checking Linear-Time Properties of Probabilistic Systems.
In: Handbook of Weighted Automata, chapter 13,
pp. 519–570,
doi:10.1007/978-3-642-01492-5_13.
Jean Berstel & Christophe Reutenauer (1982):
Recognizable Formal Power Series on Trees.
Theoretical Computer Science 18(2),
pp. 115–148,
doi:10.1016/0304-3975(82)90019-6.
Manfred Droste, Werner Kuich & Heiko Vogler (2009):
Handbook of Weighted Automata.
Monographs in Theoretical Computer Science. An EATCS Series.
Springer,
doi:10.1007/978-3-642-01492-5.
Manfred Droste & Dietrich Kuske (2021):
Weighted Automata.
In: Jean-Eric Pin: Handbook of Automata Theory, chapter 4 1.
EMS Press,
pp. 113–150,
doi:10.4171/automata-1/4.
Jonathan S. Golan (1999):
Semirings and their Applications.
Kluwer Academic,
Dordrecht,
doi:10.1007/978-94-015-9333-5.
Udo Hebisch & Hanns J. Weinert (1998):
Semirings—Algebraic Theory and Applications in Computer Science.
Series in Algebra 5.
World Scientific,
doi:10.1142/3903.
Gerard Jacob (1980):
Un théorème de factorisation des produits d'endomorphismes de K^n.
Journal of Algebra 63(2),
pp. 389–412,
doi:10.1016/0021-8693(80)90080-0.
Daniel Kirsten (2011):
The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable.
Acta Cybernetica 20(2),
pp. 211–221,
doi:10.14232/actacyb.20.2.2011.1.
Kevin Knight & Jonathan May (2009):
Applications of Weighted Automata in Natural Language Processing.
In: Handbook of Weighted Automata, chapter 14,
pp. 571–596,
doi:10.1007/978-3-642-01492-5_14.
Werner Kuich & Arto Salomaa (1986):
Semirings, Automata, Languages.
Monographs in Theoretical Computer Science. An EATCS Series.
Springer,
doi:10.1007/978-3-642-69959-7.
James Milne (2020):
A Primer of Commutative Algebra.
https://www.jmilne.org/math/xnotes/CA.pdf.
Antonio Munoz, Sakir Sezer, Dwayne Burns & Gareth Douglas (2011):
An Approach for Unifying Rule Based Deep Packet Inspection.
In: Proc.\@m IEEE Int.\@m Conf.\@m on Communications.
IEEE,
pp. 1–5,
doi:10.1109/icc.2011.5963095.
Micheal O. Rabin & Dana Scott (1959):
Finite Automata and Their Decision Problems.
IBM Journal of Research and Development 3(2),
pp. 114–125,
doi:10.1147/rd.32.0114.
Christophe Reutenauer (1980):
An Ogden-like Iteration Lemma for Rational Power Series.
Acta Informatica 13(2),
pp. 189–197,
doi:10.1007/bf00263993.
Jacques Sakarovitch (2009):
Rational and Recognisable Power Series.
In: Handbook of Weighted Automata, chapter 4,
pp. 105–174,
doi:10.1007/978-3-642-01492-5_4.
Arto Salomaa & Matti Soittola (1978):
Automata-Theoretic Aspects of Formal Power Series.
Texts and Monographs in Computer Science.
Springer,
doi:10.1007/978-1-4612-6264-0.
Marcel-Paul Schützenberger (1961):
On a Special Class of Recurrent Events.
The Annals of Mathematical Statistics 32(4),
pp. 1201–1213,
doi:10.1214/aoms/1177704860.
Marcel-Paul Schützenberger (1961):
On the Definition of a Family of Automata.
Information and Control 4(2–3),
pp. 245–270,
doi:10.1016/S0019-9958(61)80020-X.
Mark P. J. van der Loo & Edwin de Jonge (2021):
Data Validation Infrastructure for R.
Journal of Statistical Software 97(10),
pp. 1–31,
doi:10.18637/jss.v097.i10.
eptcs@eptcs.org