Skip to main content
Conference Proceedings

Variants of distributed P automata and the efficient parallelizability of languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7184 LNCS 51-61
DOI: 10.1007/978-3-642-28024-5_5
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give an overview of P automata and distributed P automata and the parallelizability of their accepted languages by focusing on those features of these systems which influence the efficiency of the parallelization. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Vaszil, G. (2012). Variants of distributed P automata and the efficient parallelizability of languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7184 LNCS, pp. 51–61). https://doi.org/10.1007/978-3-642-28024-5_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free