Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages

DOI10.1007/978-3-642-22256-6_5zbMath1297.03021OpenAlexW2218477186MaRDI QIDQ5200050

Annie Foret, Denis Béchet, Alexander Dikovsky

Publication date: 29 July 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22256-6_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic of natural languages (03B65) Automata and formal grammars in connection with logical questions (03D05) Natural language processing (68T50)

Related Items (1)

Biography of Alexandre Dikovsky

Cites Work

• Unnamed Item
• Unnamed Item
• Two Models of Learning Iterated Dependencies
• The Mathematics of Sentence Structure
• 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