Henk Barendregt (1984):
The Lambda Calculus: Its Syntax and Semantics.
Studies in Logic and the Foundations of Mathematics 103.
North-Holland.
Hans Beki\'c (1984):
Definable operations in general algebras, and the theory of automata and flowcharts.
In: C.B. Jones: Programming Languages and Their Definition,
Lecture Notes in Computer Science 177.
Springer Berlin Heidelberg,
pp. 30–55,
doi:10.1007/BFb0048939.
Bruno Courcelle (1986):
Equivalences and Transformations of Regular Systems – Applications to Recursive Program Schemes and Grammars.
Theoretical Computer Science 42,
pp. 1–122,
doi:10.1016/0304-3975(86)90050-2.
Zoltán Ésik & Werner Kuich (2007):
Modern automata theory.
Unpublished manuscript.
Zoltán Ésik & Hans Leiß (2002):
Greibach Normal Form in Algebraically Complete Semirings.
In: CSL '02: Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic.
Springer-Verlag,
London, UK,
pp. 135–150,
doi:10.1007/3-540-45793-3_10.
Zoltán Ésik & Hans Leiß (2005):
Algebraically Complete Semirings and Greibach Normal Form.
Annals of Pure and Applied Logic 133,
pp. 173–203,
doi:10.1016/j.apal.2004.10.008.
Jozef Gruska (1971):
A characterization of context-free languages.
J. Comput. Syst. Sci. 5(4),
pp. 353–364,
doi:10.1016/S0022-0000(71)80023-5.
Mark Hopkins (2008):
The Algebraic Approach I: The Algebraization of the Chomsky Hierarchy.
In: R. Berghammer, B. Möller & G. Struth: Proc. 10th Int. Conf. Relational Methods in Computer Science and 5th Int. Conf. Applications of Kleene Algebra (RelMiCS/AKA 2008),
Lecture Notes in Computer Science 4988.
Springer-Verlag,
Berlin Heidelberg,
pp. 155–172,
doi:10.1007/978-3-540-78913-0_13.
Mark Hopkins (2008):
The Algebraic Approach II: Dioids, Quantales and Monads.
In: R. Berghammer, B. Möller & G. Struth: Proc. 10th Int. Conf. Relational Methods in Computer Science and 5th Int. Conf. Applications of Kleene Algebra (RelMiCS/AKA 2008),
Lecture Notes in Computer Science 4988.
Springer-Verlag,
Berlin Heidelberg,
pp. 173–190,
doi:10.1007/978-3-540-78913-0_14.
Dexter Kozen (1981):
On Induction vs. *-Continuity.
In: Proc. Logics of Programs,
Lecture Notes in Computer Science (LNCS) 131.
Springer,
pp. 167–176,
doi:10.1007/BFb0025769.
Dexter Kozen (1983):
Results on the propositional [mu]-calculus.
Theoretical Computer Science 27(3),
pp. 333 – 354,
doi:10.1016/0304-3975(82)90125-6.
Dexter Kozen (1991):
The Design and Analysis of Algorithms.
Springer-Verlag,
New York,
doi:10.1007/978-1-4612-4400-4.
Hans Leiß (1992):
Towards Kleene Algebra with Recursion.
In: CSL '91: Proceedings of the 5th Workshop on Computer Science Logic.
Springer-Verlag,
London, UK,
pp. 242–256,
doi:10.1007/BFb0023771.
Glynn Winskel (1993):
The Formal Semantics of Programming Languages.
MIT Press.
eptcs@eptcs.org