Algebraically complete semirings and Greibach normal form (Q1772777)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Algebraically complete semirings and Greibach normal form
scientific article

    Statements

    Algebraically complete semirings and Greibach normal form (English)
    0 references
    0 references
    0 references
    21 April 2005
    0 references
    The authors define Park \({\mu}\)-semirings, which are ordered semirings with enough least pre-fixed points to interpret all \(\mu\)-terms. After that they add two more natural conditions, both inequations, to the axioms of Park \({\mu}\)-semirings in order to obtain algebraically complete semirings. An iteration {*} is defined which makes any algebraically complete semiring a symmetric inductive {*}-semiring and, if + is idempotent, a Kleene algebra. The main example is the semiring of a context-free language. The authors identify context-free grammars with simultaneous least-fixed-point terms \(\mu\overrightarrow{x}.\overrightarrow{t}\), where\(\overrightarrow{t}\) are polynomials. They show that the main normal forms for context-free grammars are equations between \(\mu\)-terms that hold in all algebraically complete semirings. Equational properties of fixed-point are sufficient for the core of the Greibach normal form and inequational properties (and idempotence of the semirings) are necessary for elimination of chain rules and \(\epsilon\)-rules. The paper ends with some open problems and concluding remarks.
    0 references
    Greibach normal form
    0 references
    context-free languages
    0 references
    pre-fixed-point induction
    0 references
    equational theory
    0 references
    Conway semiring
    0 references
    Kleene algebra
    0 references
    algebraically complete semiring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references