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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101532935 / 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: Q3505125 / 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: 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: 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: Q5581642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of oscillatory properties of the solutions of two coupled, first order non-linear ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Programs for Generating Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A frame for general divide-and-conquer recurrences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank

Latest revision as of 12:10, 24 June 2024

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

    Statements

    Generating all permutations by context-free grammars in Chomsky normal form (English)
    0 references
    0 references
    28 April 2006
    0 references
    Context-free grammar
    0 references
    Chomsky normal form
    0 references
    Permutation
    0 references
    Descriptional complexity
    0 references
    Unambiguous grammar
    0 references
    0 references
    0 references

    Identifiers