Minimalist tree languages are closed under intersection with recognizable tree languages

DOI10.1007/978-3-642-22221-4_9MaRDI QIDQ3010341zbMATH OpenOpenAlexFDO

Authors Gregory M. Kobele

Publication date 1 July 2011

Published in Logical Aspects of Computational Linguistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22221-4_9

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Closure properties of minimalist derivation tree languages
• scientific article; zbMATH DE number 1786553
• Locality and the complexity of minimalist derivation tree languages
• Minimalist Grammars and Minimalist Categorial Grammars: Toward Inclusion of Generated Languages
• Models of adjunction in minimalist grammars

Cited in

(7)

• A Single Movement Normal Form for Minimalist Grammars
• Models of adjunction in minimalist grammars
• Closure properties of minimalist derivation tree languages
• Locality and the complexity of minimalist derivation tree languages
• scientific article; zbMATH DE number 1786553 (Why is no real title available?)
• There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages
• Case theory in minimalist grammars

This page was built for publication: Minimalist tree languages are closed under intersection with recognizable tree languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010341)