Normal forms for context-sensitive grammars

DOI10.1007/BF00288653MaRDI QIDQ1845477zbMATH OpenFDO

Authors Armin B. Cremers

Publication date 1973

Published in Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3431782 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3351211 (Why is no real title available?)
• scientific article; zbMATH DE number 3368172 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• A hierarchy between context-free and context-sensitive languages
• A note on leftmost restricted random context grammars
• A note on scattered context grammars
• Classes of languages and linear-bounded automata
• Control sets on grammars
• Direction controlled programmed grammars
• Matrix grammars with a leftmost restriction
• On matrix languages
• On the structure of context-sensitive grammars
• Periodically time-variant context-free grammars
• Programmed Grammars and Classes of Formal Languages
• Scattered context grammars
• Simple matrix languages with a leftmost restriction
• Some restrictive devices for context-free grammars

Cited in

(6)

• On weak growing context-sensitive grammars
• A note on leftmost restricted random context grammars
• On growing context-sensitive languages
• Classes of formal grammars
• An algebraic technique for context-sensitive parsing
• Size, index, and context-sensitivity of controlled partition grammars

This page was built for publication: Normal forms for context-sensitive grammars

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