scientific article; zbMATH DE number 4028929

MaRDI QIDQ3769985zbMATH OpenFDO

Authors G. Ciucar, Gheorghe Păun

Publication date 1987

zbMATH Keywords

pure grammarpure languagesyntactical complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 428239
• Descriptional complexity of context-free grammar forms
• scientific article; zbMATH DE number 165816
• scientific article; zbMATH DE number 3850491
• scientific article; zbMATH DE number 617134

Cited in

(11)

• On some derivation mechanisms and the complexity of their Szilard languages
• scientific article; zbMATH DE number 165816 (Why is no real title available?)
• A syntactic view of computational adequacy
• Syntactic complexity of suffix-free languages
• scientific article; zbMATH DE number 428239 (Why is no real title available?)
• scientific article; zbMATH DE number 23770 (Why is no real title available?)
• A note on pure and p-pure languages
• On Syntactic versus Computational Views of Approximability
• scientific article; zbMATH DE number 1869614 (Why is no real title available?)
• On the compressibility of finite languages and formal proofs
• scientific article; zbMATH DE number 4028931 (Why is no real title available?)

This page was built for publication:

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