Generating all permutations by context-free grammars in Greibach normal form (Q2378538): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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 / OpenAlex ID
 
Property / OpenAlex ID: W2155700996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower-bound for the number of productions required for a certain class of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all permutations by context-free grammars in Chomsky normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3505125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for some subclasses of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a problem in the theory of grammatical complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free complexity of finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concise description of finite languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3051401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313790 / 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: A pushdown automaton or a context-free grammar - which is more economical? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reducing the number of states in a PDA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some classifications of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of normal form grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration procedure for determining approximate solutions to non-linear oscillator equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A frame for general divide-and-conquer recurrences / rank
 
Normal rank

Latest revision as of 22:28, 28 June 2024

scientific article
Language Label Description Also known as
English
Generating all permutations by context-free grammars in Greibach normal form
scientific article

    Statements

    Generating all permutations by context-free grammars in Greibach normal form (English)
    0 references
    0 references
    8 January 2009
    0 references
    context-free grammar
    0 references
    Greibach normal form
    0 references
    permutation
    0 references
    descriptional complexity
    0 references
    unambiguous grammar
    0 references

    Identifiers