As a supplement to my talk at the workshop, this extended abstract motivates and summarizes my work with co-authors on problems in two separate areas: first, in the lambda-calculus with letrec, a universal model of computation, and second, on Milner's process interpretation of regular expressions, a proper subclass of the finite-state processes. The aim of my talk was to motivate a transferal of ideas for workable concepts of structure-constrained graphs: from the problem of finding compact graph representations for terms in the lambda-calculus with letrec to the problem of recognizing finite process graphs that can be expressed by regular expressions. In both cases the construction of structure-constrained graphs was expedient in order to enable to go back and forth easily between, in the first case, lambda-terms and term graphs, and in the second case, regular expressions and process graphs. The main focus here is on providing pointers to my work with co-authors, in both areas separately. A secondary focus is on explaining directions of my present projects, and describing research questions of possibly general interest that have developed out of my work in these two areas.

翻译：作为对我在研讨会上报告的补充，本扩展摘要旨在阐述并总结我与合作者在两个独立领域的研究工作：首先是在带letrec的λ演算（一种通用计算模型）中的问题；其次是在米尔纳对正则表达式的进程解释（有限状态进程的一个真子类）中的问题。我的报告旨在推动结构约束图的可操作概念在思想上的迁移：从为带letrec的λ演算中的项寻找紧凑图表示的问题，迁移到识别可由正则表达式表达的有限进程图的问题。在这两种情况下，构建结构约束图都是有益的，以便能够轻松地在两者之间进行转换：第一种情况是在λ项与项图之间，第二种情况是在正则表达式与进程图之间。本文的重点在于分别提供对我在两个领域与合作者工作的指引。次要重点在于解释我当前项目的方向，并描述从这两个领域工作中产生的、可能具有普遍意义的研究问题。