A characterization of minimalist languages

DOI10.1007/3-540-48199-0_12MaRDI QIDQ4547851zbMATH OpenFDO

Authors Henk Harkema

Publication date 21 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2099/20990193

Mathematics Subject Classification ID

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

Recommendations

• Minimalist Grammars and Minimalist Categorial Grammars: Toward Inclusion of Generated Languages
• Derivational minimalism is mildly context-sensitive
• Strict deterministic aspects of minimalist grammars
• Transforming linear context-free rewriting systems into minimalist grammars
• Minimalist tree languages are closed under intersection with recognizable tree languages

Cited in

(15)

• Structural similarity within and among languages
• Geometric representations for minimalist grammars
• Derivational minimalism is mildly context-sensitive
• A Single Movement Normal Form for Minimalist Grammars
• Well-nestedness properly subsumes strict derivational minimalism
• Minimalist tree languages are closed under intersection with recognizable tree languages
• Disentangling notions of specifier impenetrability: late adjunction, islands, and expressive power
• Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard
• Minimal NFA and biRFSA Languages
• scientific article; zbMATH DE number 95311 (Why is no real title available?)
• Transforming linear context-free rewriting systems into minimalist grammars
• Minimal covers of formal languages
• scientific article; zbMATH DE number 777478 (Why is no real title available?)
• Observations on strict derivational minimalism
• Strict deterministic aspects of minimalist grammars

This page was built for publication: A characterization of minimalist languages

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