S. L. Bloom & Z. Ésik (1993):
Iteration Theories.
EATCS Monographs on Theoretical Computer Science.
Springer,
doi:10.1007/978-3-642-78034-9.
W. Bucher & H. Maurer (1984):
Theoretische Grundlagen der Programmiersprachen.
B. I. Wissenschaftsverlag.
R. S. Cohen & A. Y. Gold (1977):
Theory of ω-Languages I: Characterizations of ω-Context-Free Languages.
Journal of Computer and System Sciences 15(2),
pp. 169–184,
doi:10.1016/S0022-0000(77)80004-4.
J. H. Conway (1971):
Regular Algebra and Finite Machines.
Chapman & Hall.
Z. Ésik & W. Kuich (2004):
A Semiring-Semimodule Generalization of ω-Context-Free Languages.
In: Theory is Forever,
Lecture Notes in Computer Science 3113.
Springer,
pp. 68–80,
doi:10.1007/978-3-540-27812-2_7.
Z. Ésik & W. Kuich (2005):
A Semiring-Semimodule Generalization of ω-Regular Languages II.
Journal of Automata Languages and Combinatorics 10,
pp. 243–264.
Z. Ésik & W. Kuich (2007):
On Iteration Semiring-Semimodule Pairs.
In: Semigroup Forum 75.
Springer,
pp. 129–159,
doi:10.1007/s00233-007-0709-7.
Z. Ésik & W. Kuich (2007):
A Semiring-Semimodule Generalization of Transducers and Abstract ω-Families of Power Series.
Journal of Automata, Languages and Combinatorics 12(4),
pp. 435–454.
M. A. Harrison (1978):
Introduction to Formal Language Theory,
1st edition.
Addison-Wesley.
W. Kuich (1997):
Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata Theory.
In: Handbook of Formal Languages, Vol. I, chapter 9.
Springer,
pp. 609–677,
doi:10.1007/978-3-642-59136-5_9.
W. Kuich & A. Salomaa (1986):
Semirings, Automata, Languages.
EATCS Monographs on Theoretical Computer Science 5.
Springer,
doi:10.1007/978-3-642-69959-7.
D. Perrin & J.-É. Pin (2004):
Infinite Words: Automata, Semigroups, Logic and Games.
Pure and Applied Mathematics 141.
Elsevier,
doi:10.1016/S0079-8169(13)62900-1.
A. Salomaa & M. Soittola (1978):
Automata-Theoretic Aspects of Formal Power Series.
Springer,
doi:10.1007/978-1-4612-6264-0.
eptcs@eptcs.org