On normal form grammars and their size

DOI10.1142/9789814317610_0006MaRDI QIDQ4922674zbMATH OpenOpenAlexFDO

Authors Alica Kelemenová, Lucie Ciencialová, Luděk Cienciala

Publication date 3 June 2013

Published in Automata, Formal Languages and Algebraic Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814317610_0006

zbMATH Keywords

normal form grammarposition restricted grammarsize complexity

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Complexity of normal form grammars
• Greibach normal form transformation revisited.
• Normal form algorithms for extended context-free grammars
• scientific article; zbMATH DE number 1452979
• scientific article; zbMATH DE number 4039329

Cited in

(11)

• scientific article; zbMATH DE number 4014051 (Why is no real title available?)
• Normal forms for multiple context-free languages and displacement Lambek grammars
• scientific article; zbMATH DE number 4039329 (Why is no real title available?)
• scientific article; zbMATH DE number 30957 (Why is no real title available?)
• scientific article; zbMATH DE number 2080940 (Why is no real title available?)
• scientific article; zbMATH DE number 1452979 (Why is no real title available?)
• Normal-order reduction grammars
• scientific article; zbMATH DE number 4189198 (Why is no real title available?)
• Implementation and Application of Automata
• Normal form algorithms for extended context-free grammars
• Complexity of normal form grammars

This page was built for publication: On normal form grammars and their size

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