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.
Jos Baeten, Flavio Corradini & Clemens Grabmayer (2007):
A Characterization of Regular Expressions Under Bisimulation.
Journal of the ACM 54(2),
doi:10.1145/1219092.1219094.
Doeko Bosscher (1997):
Grammars Modulo Bisimulation.
University of Amsterdam.
Clemens Grabmayer (2019):
Modeling Terms by Graphs with Structure-Constraints (Two Illustrations).
In: TERMGRAPH 2018 post-proceedings 288,
pp. 1–13,
doi:10.4204/EPTCS.288.
Clemens Grabmayer (2020):
Structure-Constrained Process Graphs for the Process Interpretation of Regular Expressions.
Technical Report arXiv:2012.10869.
arxiv.org.
Clemens Grabmayer & Wan Fokkink (2020):
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity.
In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,
LICS ’20.
ACM,
New York, NY, USA,
pp. 465–478,
doi:10.1145/3373718.3394744.
Clemens Grabmayer & Wan Fokkink (2020):
A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity.
Technical Report arXiv:2004.12740.
arxiv.org.
Report version of grab:fokk:2020:LICS.
Clemens Grabmayer & Jan Rochel (2014):
Maximal Sharing in the Lambda Calculus with Letrec.
ACM SIGPLAN Notices 49(9),
pp. 67–80,
doi:10.1145/2692915.2628148.
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.
Jos Vrancken (1997):
The Algebra of Communicating Processes with Empty Process.
Theoretical Computer Science 177(2),
pp. 287 – 328,
doi:10.1016/S0304-3975(96)00250-2.