Skip to main content
Conference Proceedings

A good class of tree automata. Application to inductive theorem proving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1443 LNCS 409-420
DOI: 10.1007/bfb0055071
7Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Lugiez, D. (1998). A good class of tree automata. Application to inductive theorem proving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 409–420). https://doi.org/10.1007/bfb0055071

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