scientific article; zbMATH DE number 907954

MaRDI QIDQ4886800zbMATH OpenFDO

Authors Liming Cai

Publication date 26 November 1996

zbMATH Keywords

computational complexitycontext-sensitive grammarsparallel communicating grammar systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• The computational complexity of PCGS with regular components
• scientific article; zbMATH DE number 97565
• scientific article; zbMATH DE number 878943
• scientific article; zbMATH DE number 907951
• On the generative capacity of parallel communicating grammar systems

Cited in

(4)

• The computational complexity of PCGS with regular components
• Computational structure of GPSG models
• On the computational power of context-free PC grammar systems
• Emergence in context-free parallel communicating grammar systems: what does and does not make a grammar system more expressive than its parts

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 Q4886800)