scientific article; zbMATH DE number 4028929

zbMATH Open0632.68073MaRDI QIDQ3769985FDOQ3769985

Authors: G. Ciucar, Gheorghe Păun 

Publication date: 1987

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

pure grammarpure languagesyntactical complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• On some derivation mechanisms and the complexity of their Szilard languages
• Title not available (Why is that?)
• A syntactic view of computational adequacy
• Title not available (Why is that?)
• Syntactic complexity of suffix-free languages
• Title not available (Why is that?)
• A note on pure and \(p\)-pure languages
• On Syntactic versus Computational Views of Approximability
• Title not available (Why is that?)
• On the compressibility of finite languages and formal proofs
• Title not available (Why is that?)

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)