Skip to main content
Conference Proceedings

A decidable characterization of locally testable tree languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5556 LNCS(PART 2) 285-296
DOI: 10.1007/978-3-642-02930-1_24
5Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A regular tree language L is locally testable if the membership of a tree into L depends only on the presence or absence of some neighborhoods in the tree. In this paper we show that it is decidable whether a regular tree language is locally testable. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Place, T., & Segoufin, L. (2009). A decidable characterization of locally testable tree languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5556 LNCS, pp. 285–296). https://doi.org/10.1007/978-3-642-02930-1_24

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