Stål Aanderaa (1965):
On the Algebra of Regular Expressions.
Technical Report.
Applied Mathematics, Harvard University.
Valentin Antimirov (1996):
Partial Derivatives of Regular Expressions and Finite Automaton Constructions.
Theoretical Computer Science 155(2),
pp. 291–319,
doi:10.1016/0304-3975(95)00182-4.
J.C.M. Baeten & F. Corradini (2005):
Regular Expressions in Process Algebra.
In: Proceedings of LICS 2005.
IEEE Computer Society 2005,
pp. 12–19,
doi:10.1109/LICS.2005.43.
J.C.M. Baeten, F. Corradini & C.A. Grabmayer (2007):
A Characterization of Regular Expressions Under Bisimulation.
Journal of the ACM 54(2),
doi:10.1145/1219092.1219094.
J.A. Bergstra, I. Bethke & A. Ponse (1994):
Process algebra with iteration and nesting.
The Computer Journal 37(4),
pp. 243–258,
doi:10.1093/comjnl/37.4.243.
Stefan Blom (2001):
Term Graph Rewriting, Syntax and Sematics.
Vrije Universiteit Amsterdam.
D. J. B. Bosscher (1997):
Grammars Modulo Bisimulation.
Universiteit van Amsterdam.
Irving M. Copi, Calvin C. Elgot & Jesse B. Wright (1958):
Realization of Events by Logical Nets.
Journal of the Association For Computing Machinery 5(2),
doi:10.1007/978-1-4613-8177-8_1.
Also in Stephen L. Bloom (editor): `Calvin C. Elgot: Selected Papers', p. 1–16, Springer, 1982.
Flavio Corradini, Rocco De Nicola & Anna Labella (2002):
An Equational Axiomatization of Bisimulation over Regular Expressions.
Journal of Logic and Computation 12(2),
pp. 301–320,
doi:10.1093/logcom/12.2.301.
W.J. Fokkink (1996):
An Axiomatization for the Terminal Cycle.
Technical Report 167.
Utrecht University, Logic Group Preprint Series.
Available at http://bit.ly/2uJVEDF (on semanticscholar.com).
W.J. Fokkink (1997):
Axiomatizations for the perpetual loop in process algebra.
In: P. Degano, R. Gorrieri & A. Marchetti-Spaccamela: Proceedings of the 24th Colloquium on Automata, Languages and Programming - ICALP'97, Bologna,
LNCS 1256.
Springer,
pp. 571–581,
doi:10.1007/3-540-63165-8_212.
Clemens Grabmayer & Jan Rochel (2013):
Term Graph Representations for Cyclic Lambda Terms.
In: Proceedings of TERMGRAPH 2013,
EPTCS 110,
pp. 56–73,
doi:10.4204/EPTCS.110.
ArXiv:1302.6338v1.
Clemens Grabmayer & Jan Rochel (2014):
Maximal Sharing in the Lambda Calculus with Letrec.
In: Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming,
ICFP '14.
ACM,
New York, NY, USA,
pp. 67–80,
doi:10.1145/2628136.2628148.
Clemens Grabmayer & Vincent van Oostrom (2015):
Nested Term Graphs.
In: Aart Middeldorp & Femke van Raamsdonk: Post-Proceedings of TERMGRAPH 2014, Vienna, Austria, July 13, 2014,
EPTCS 183.
Open Publishing Association,
pp. 48–65,
doi:10.4204/EPTCS.183.4.
ArXived at:1405.6380v2.
S.C. Kleene (1951):
Representation of Events in Nerve Nets and Finite Automata.
Technical Report.
U.S. Air Force Project RAND Research Memorandum RM-704,
doi:http://dx.doi.org/10.1515/9781400882618-002.
Robin Milner (1984):
A Complete Inference System for a Class of Regular Behaviours.
Journal of Computer and System Sciences 28(3),
pp. 439 – 466,
doi:10.1016/0022-0000(84)90023-0.
Jan Rochel & Clemens Grabmayer (2014):
Maximal Sharing in the Lambda Calculus with letrec.
Haskell Implementation of the method of grab:roch:2014:ICFP, available at http://hackage.haskell.org/package/maxsharing/.
Jan Rochel (2016):
Unfolding Semantics of the Untyped λ-Calculus with letrec.
Utrecht University.
Defended on June 20, 2016. Available at http://rochel.info/thesis/thesis.pdf.
Arto Salomaa (1966):
Two Complete Axiom Systems for the Algebra of Regular Events.
Journal of the ACM 13(1),
pp. 158–169,
doi:10.1145/321312.321326.