On the Parallel Complexity of Tree Automata

Authors:
Markus Lohrey
Affiliations:
-
Venue:
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Year:
2001

Citing 19
Cited 5

The Boolean formula value problem is in ALOGTIME

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Problems complete for deterministic logarithmic space

Journal of Algorithms
On the relative complexity of some languages in NC

Information Processing Letters
On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Properties that characterize LOGCFL

Journal of Computer and System Sciences
Circuits, matrices, and nonassociative computation

Journal of Computer and System Sciences
Parenthesis Grammars

Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Tree-Walking Pebble Automata

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
On the Complexities of Linear LL(1) and LR(1) Grammars

FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization

KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
Circuits And Expressions With Non-Associative Gates

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Note on the Hardness of Tree Isomorphism

COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
The Complexity of Acyclic Conjunctive Queries

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Complexity of finitely presented algebras

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Space-bounded reducibility among combinatorial problems

Journal of Computer and System Sciences
Tree acceptors and some of their applications

Journal of Computer and System Sciences

Incremental Validation of XML Documents

ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Incremental validation of XML documents

ACM Transactions on Database Systems (TODS)
Compressedword problems for inverse monoids

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Tree automata and XPath on compressed trees

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We determine the parallel complexity of several (uniform) membership problems for recognizable tree languages. Furthermore we show that the word problem for a fixed finitely presented algebra is in DLOGTIME-uniform NC1.