A new algorithm for regularizing one-letter context-free grammars. (Q1426442)

From MaRDI portal
Revision as of 03:06, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A new algorithm for regularizing one-letter context-free grammars.
scientific article

    Statements

    A new algorithm for regularizing one-letter context-free grammars. (English)
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    Reduction of a context-free grammar
    0 references
    One-letter context-free language
    0 references
    Regular expression
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references