The computational complexity of PCGS with regular components

MaRDI QIDQ5485989zbMATH OpenFDO

Authors Liming Cai

Publication date 6 September 2006

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 907954
• scientific article; zbMATH DE number 907951
• scientific article; zbMATH DE number 878943
• On the generative capacity of parallel communicating grammar systems
• On the generative capacity of parallel communicating grammar systems

Cited in

(7)

• On the complexity of Szilard languages of regulated grammars
• On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
• On the power of parallel communicating grammar systems with right-linear components
• scientific article; zbMATH DE number 1372648 (Why is no real title available?)
• scientific article; zbMATH DE number 907954 (Why is no real title available?)
• Nonreturning PC grammar systems can be simulated by returning systems
• Parallel complexity of the regular code problem

This page was built for publication: The computational complexity of PCGS with regular components

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