Skip to main content
Conference Proceedings

Advocating ownership

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1180 286-297
DOI: 10.1007/3-540-62034-6_57
10Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show the equivalence of deterministic auxiliary pushdown automata to owner write PRAMs in a fairly large setting by proving that DAuxPDA-TISP(fo(1),log g) and CROW-TIPR(log f, go(1)) coincide. Such, we provide the first circuit characterizations of depth O(log f) for deterministic sequential automata which are f time-bounded.

Cite

CITATION STYLE

APA

Fernau, H., Lange, K. J., & Reinhardt, K. (1996). Advocating ownership. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1180, pp. 286–297). Springer Verlag. https://doi.org/10.1007/3-540-62034-6_57

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