Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages (Q442141): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2012.04.024 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q5536273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematics of Sentence Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Categorial Dependency Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Automata and a Normal Form for Categorial Dependency Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Aspects of Computational Linguistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331781 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2012.04.024 / rank
 
Normal rank

Latest revision as of 18:45, 9 December 2024

scientific article
Language Label Description Also known as
English
Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages
scientific article

    Statements

    Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages (English)
    0 references
    0 references
    0 references
    0 references
    9 August 2012
    0 references
    formal grammars
    0 references
    categorial grammars
    0 references
    language hierarchy
    0 references
    iterated types
    0 references

    Identifiers