Two lower bounds on distributive generation of languages

DOI10.1007/3-540-58338-6_89MaRDI QIDQ5096901zbMATH OpenOpenAlexFDO

Authors Juraj Hromkovič, Jarkko Kari, Lila Kari, Dana Pardubská

Publication date 18 August 2022

Published in Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58338-6_89

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 871242
• scientific article; zbMATH DE number 1333610
• scientific article; zbMATH DE number 1502103
• Some hierarchies for the communication complexity measures of cooperating grammar systems
• scientific article; zbMATH DE number 97565

Cites work

• scientific article; zbMATH DE number 8777 (Why is no real title available?)
• scientific article; zbMATH DE number 23841 (Why is no real title available?)
• scientific article; zbMATH DE number 3480114 (Why is no real title available?)
• scientific article; zbMATH DE number 1333610 (Why is no real title available?)
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• The impact of the number of cooperating grammars on the generative power

Cited in

(4)

• scientific article; zbMATH DE number 1333610 (Why is no real title available?)
• scientific article; zbMATH DE number 871242 (Why is no real title available?)
• Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
• Nonreturning PC grammar systems can be simulated by returning systems

This page was built for publication: Two lower bounds on distributive generation of languages

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