The computational complexity of PCGS with regular components

zbMATH Open1096.68640MaRDI QIDQ5485989FDOQ5485989

Authors: Liming Cai 

Publication date: 6 September 2006

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

Mathematics Subject Classification ID

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

Cited In (5)

• 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
• Parallel complexity of the regular code problem
• Nonreturning PC grammar systems can be simulated by returning systems

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)