scientific article; zbMATH DE number 1405691

MaRDI QIDQ4938672zbMATH OpenFDO

Authors Tomasz Jurdziński, Mirosław Kutyłowski, Krzysztof Loryś

Publication date 3 April 2000

zbMATH Keywords

finite automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1754655
• Measuring communication in parallel communicating finite automata
• Two-party Watson-Crick computations
• Measuring communication in automata systems (invited paper)
• Communication complexity

Cited in

(6)

• Efficient simulation of synchronous systems by multi-speed systems
• Two-party Watson-Crick computations
• scientific article; zbMATH DE number 1754655 (Why is no real title available?)
• Automata, Languages and Programming
• Function-Dependent Commitments for Verifiable Multi-party Computation
• Restarting automata with restricted utilization of auxiliary symbols

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