# Tree automaton

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2008

Highly Cited

2008

- Inf. Syst.
- 2008

Implementations that load XML documents and give access to them via, e.g., the D OM, suffer from huge memory demands: the spaceâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- 21st Annual IEEE Symposium on Logic in Computerâ€¦
- 2006

We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated byâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Theor. Comput. Sci.
- 2002

A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unaryâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- 2001

A coherent exposition of the connection of alternating tree automata and modal Î¼-calculus is given, advocating an automaton modelâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- SIAM J. Comput.
- 1999

The complexity of testing nonemptiness of finite state automata on infinite trees is investigated. It is shown that for treeâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- STOC
- 1998

Automata on in nite words and trees are used for speci cation and veri cation of nonterminating programs. The veri cation and theâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- 1991

We show that the propositional Mu Calculus is eq uivalent in expressive power to nite automata on in nite trees Sinceâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- STACS
- 1989

We s h o w : f o r mJe~j constant m i t can be decided i n p o l y n o m i a l t ime whether or not two m-ambiguous finite treeâ€¦Â (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- STOC
- 1982

In 1969 Rabin introduced tree automata and proved one of the deepest decidability results. If you worked on decision problems youâ€¦Â (More)

Is this relevant?

Highly Cited

1970

Highly Cited

1970

- Mathematical systems theory
- 1970

Recent developments in the theory of automata have pointed to an extension of the domain of definition of automata from stringsâ€¦Â (More)

Is this relevant?