scientific article; zbMATH DE number 1795910

zbMATH Open1021.68048MaRDI QIDQ4550982FDOQ4550982

Authors: Tomasz Jurdziński, Mirosław Kutyłowski, Paweł Rzechonek, J. Zatopiański 

Publication date: 11 November 2002

Title of this publication is not available (Why is that?)

Recommendations

• Communication complexity of multi-processor systems
• scientific article; zbMATH DE number 1502112
• Communication Complexity and Lower Bounds on Multilective Computations
• scientific article; zbMATH DE number 1361468
• Measuring communication in parallel communicating finite automata
• Communication complexity in number-conserving and monotone cellular automata
• Mathematical Foundations of Computer Science 2005
• Communication Complexity of Wait-Free Computability in Dynamic Networks
• On the Computational Capacity of Parallel Communicating Finite Automata
• On the computational capacity of parallel communicating finite automata

zbMATH Keywords

bounded memory asynchronous systemsmulti-speed systems of finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (1)

• Efficient simulation of synchronous systems by multi-speed systems

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