The hardest language for grammars with context operators (Q6038689): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Non-prinicipalité du cylindre des langages à compteur / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of context-free grammars with one-sided context specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-sided context specifications in formal grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear grammars with one-sided contexts and their automaton representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized LR parsing algorithm for grammars with one-sided contexts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-space recognition for grammars with contexts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Le cylindre des langages linéaires / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relations Defined by Generalized Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preservation of unambiguity and inherent ambiguity in context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardest Context-Free Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump PDA’s and Hierarchies of Deterministic Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOOLEAN GRAMMARS AND GSM MAPPINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hardest languages for one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardest LL(k) Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsing by matrix multiplication generalized to Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved normal form for grammars with one-sided contexts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tale of conjunctive grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardest languages for conjunctive and Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive grammars with restricted disjunction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Two-Sided Contexts in Cubic Time / rank
 
Normal rank

Latest revision as of 00:56, 1 August 2024

scientific article; zbMATH DE number 7681292
Language Label Description Also known as
English
The hardest language for grammars with context operators
scientific article; zbMATH DE number 7681292

    Statements

    The hardest language for grammars with context operators (English)
    0 references
    0 references
    0 references
    2 May 2023
    0 references
    formal language theory
    0 references
    formal grammars
    0 references
    hardest formal languages
    0 references
    grammars with context operators
    0 references
    inverse homomorphisms
    0 references
    finite transducers
    0 references

    Identifiers