Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages

DOI10.1016/j.tcs.2012.04.024zbMath1284.68316OpenAlexW2089973443MaRDI QIDQ442141

Denis Béchet, Annie Foret, Alexander Dikovsky

Publication date: 9 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.024

zbMATH Keywords

categorial grammarsformal grammarsiterated typeslanguage hierarchy

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)

Related Items (1)

Biography of Alexandre Dikovsky

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Mathematics of Sentence Structure
• Abstract Automata and a Normal Form for Categorial Dependency Grammars
• Generalized Categorial Dependency Grammars
• Language identification in the limit
• Logical Aspects of Computational Linguistics

This page was built for publication: Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages