🤖 AI Summary
This paper addresses the algebraic characterization of context-free languages within *-continuous Kleene algebras.
Method: It introduces a variable-binding-free expression calculus, embedding the bracket normal form theorem into the Kleene algebra framework for the first time; employs tensor products and centralizers to characterize least fixed-point closures; and constructs a purely algebraic model grounded in automata semantics.
Contributions/Results: (1) It establishes a normal form theory for context-free languages in *-continuous Kleene algebras; (2) it proves the relative validity of the equational system C₂′ with respect to the “completeness equations”, thereby clarifying its essential distinction from C₂; and (3) it provides a novel algebraic verification paradigm for recursive definitions and syntactic structures in programming languages.
📝 Abstract
Within the tensor product $K mathop{otimes_{cal R}} C_2'$ of any ${}^*$-continuous Kleene algebra $K$ with the polycyclic ${}^*$-continuous Kleene algebra $C_2'$ over two bracket pairs there is a copy of the fixed-point closure of $K$: the centralizer of $C_2'$ in $K mathop{otimes_{cal R}} C_2'$. Using an automata-theoretic representation of elements of $Kmathop{otimes_{cal R}} C_2'$ `a la Kleene, with the aid of normal form theorems that restrict the occurrences of brackets on paths through the automata, we develop a foundation for a calculus of context-free expressions without variable binders. We also give some results on the bra-ket ${}^*$-continuous Kleene algebra $C_2$, motivate the ``completeness equation'' that distinguishes $C_2$ from $C_2'$, and show that $C_2'$ already validates a relativized form of this equation.
