Two lower bounds on distributive generation of languages

DOI10.1007/3-540-58338-6_89zbMATH Open1493.68146OpenAlexW1578877220MaRDI QIDQ5096901FDOQ5096901

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The impact of the number of cooperating grammars on the generative power
• Title not available (Why is that?)

Cited In (2)

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