A new algorithm for regularizing one-letter context-free grammars. (Q1426442): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ALGOL 60 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two iteration theorems for some families of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain formal properties of grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating finite automata with context-free grammars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Families of Languages Related to ALGOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite linear systems and one counter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language equations over a one-letter alphabet with union, concatenation and star: A complete solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708948 / rank
 
Normal rank

Latest revision as of 14:54, 6 June 2024

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