Watson-Crick automata and PCFAS with two components: a computational power analogy
Proceedings of the 1st conference on Computing frontiers
On the Computational Capacity of Parallel Communicating Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Multi-party finite computations
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Undecidability and hierarchy results for parallel communicating finite automata
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
| Hi-index | 0.89 |