Unidirectional Lambek grammars in polynomial time (Q987373): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-009-9208-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024247183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non‐associative Lambek Categorial Grammar in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematics of Sentence Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambek calculus is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of derivability for the Lambek calculus with one division / rank
 
Normal rank

Latest revision as of 02:40, 3 July 2024

scientific article
Language Label Description Also known as
English
Unidirectional Lambek grammars in polynomial time
scientific article

    Statements

    Unidirectional Lambek grammars in polynomial time (English)
    0 references
    0 references
    13 August 2010
    0 references
    Lambek calculus
    0 references
    unidirectional Lambek grammars
    0 references
    complexity
    0 references

    Identifiers