Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages

Mark Hopkins, Hans Leiß

TL;DR

The paper develops a robust algebraic framework for representing context-free languages via the tensor product of ${}^*$-continuous Kleene algebras with polycyclic and bra-ket ${\cal R}$-dioids. It introduces normal form theorems that reduce complex bracket-laden automata transitions to structured forms, enabling a calculus for context-free expressions without variable binders. A central contribution is showing that the centralizer of $C_2'$ inside $K ⊗_R C_2'$ captures exactly the context-free representations of elements from the base Kleene algebra, and that these normal forms gracefully compose under Kleene algebra operations. The work connects automata-theoretic representations to algebraic, matrix, and relational models (including completeness and relativized completeness), and points toward applications in parsing, recognition, and potentially 2-stack machine languages. Overall, it provides a foundation for an algebraic calculus of context-free languages within a unified Kleene-algebraic scheme with explicit normal forms and centralizer characterizations.

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 $K\mathop{\otimes_{\cal R}} C_2'$ à 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.

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages

TL;DR

The paper develops a robust algebraic framework for representing context-free languages via the tensor product of -continuous Kleene algebras with polycyclic and bra-ket -dioids. It introduces normal form theorems that reduce complex bracket-laden automata transitions to structured forms, enabling a calculus for context-free expressions without variable binders. A central contribution is showing that the centralizer of inside captures exactly the context-free representations of elements from the base Kleene algebra, and that these normal forms gracefully compose under Kleene algebra operations. The work connects automata-theoretic representations to algebraic, matrix, and relational models (including completeness and relativized completeness), and points toward applications in parsing, recognition, and potentially 2-stack machine languages. Overall, it provides a foundation for an algebraic calculus of context-free languages within a unified Kleene-algebraic scheme with explicit normal forms and centralizer characterizations.

Abstract

Within the tensor product of any -continuous Kleene algebra with the polycyclic -continuous Kleene algebra over two bracket pairs there is a copy of the fixed-point closure of : the centralizer of in . Using an automata-theoretic representation of elements of à 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 , motivate the ``completeness equation'' that distinguishes from , and show that already validates a relativized form of this equation.
Paper Structure (17 sections, 28 theorems, 71 equations, 4 figures)

This paper contains 17 sections, 28 theorems, 71 equations, 4 figures.

Table of Contents

  1. Introduction
  2. ${}^*$-continuous Kleene algebras and ${\cal R}$-dioids
  3. The polycyclic ${\cal R}$-dioids
  4. The tensor product $K\mathop{\otimes_{\cal R}} C$ of ${\cal R}$-dioids $K$ and $C$
  5. The centralizer $Z_{C_2'}(K \mathop{\otimes_{\cal R}} C_2')$ of $C_2'$ in $K\mathop{\otimes_{\cal R}} C_2'$
  6. Automata over a Kleene algebra
  7. Normal form theorems for $K\mathop{\otimes_{\cal R}} C_2'$ with ${\cal R}$-dioid $K$
  8. Least solutions of some polynomial inequations in Kleene algebras
  9. Normal form theorems
  10. Reduced normal form
  11. Second normal form
  12. Combining normal forms by Kleene algebra operations
  13. Bra-ket ${\cal R}$-dioids $C_m$ and the completeness property
  14. The bra-ket ${\cal R}$-dioid $C_m$ and matrix algebras
  15. Relativizing the completeness property
  16. ...and 2 more sections

Key Result

Proposition 2.1

If $D$ is an ${\cal R}$-dioid and $\rho$ an ${\cal R}$-congruence on $D$, then $D/\rho$ is an ${\cal R}$-dioid. For every $R \subseteq D\times D$ there is a least ${\cal R}$-congruence $\rho \supseteq R$ on $D$.

Figures (4)

  • Figure 1: ${\cal A} = {\langle S, A, F\rangle}$
  • Figure 2: Graph of $A$
  • Figure 3: Graph of $\tilde{A}$
  • Figure 4: Transition matrix $\tilde{A} = \tilde{U}+(\tilde{X}+\pi W) + \tilde{V}$

Theorems & Definitions (33)

  • Proposition 2.1: Proposition 1 of LeissHopkins18a
  • Proposition 2.2: Proposition 9 of Leiss22
  • Lemma 2.3
  • Theorem 2.4: Theorem 4 of LeissHopkins18a
  • Proposition 2.5: Proposition 7 of LeissHopkins18a
  • Lemma 2.6
  • Corollary 2.7
  • Corollary 2.8
  • Example 2.9
  • Theorem 2.10
  • ...and 23 more