AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically

Go Generating

AI Traceability

AI parses the academic lineage of this thesis

Generate MRT

Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

CIAA, (2008): 57-67

Cited: 46|Views25

Get fulltext within 24h

View via Publisher

Other Links

dblp.uni-trier.de dl.acm.org academic.microsoft.com

Bibtex

Keywords

nondeterministic finite tree automataantichain-based inclusion checking algorithmantichain-based universalitytree-shaped data structurenew antichain-based algorithmMore(10+)

Abstract

We propose new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata (NTA). We have implemented these algorithms in a prototype tool and our experiments show that they provide a significant improvement over the traditional determinisation-based approaches. We use our antichain-based inclusion...More

Code:

Data:

Full Text (Upload PDF)

PPT (Upload PPT)

Similar

Reference

Cited

Author

[0]

[0]

[0]

[0]

[0]

Your rating :

No Ratings