A decidable characterization of locally testable tree languages

Details A decidable characterization of locally testable tree languages A decidable characterization of locally testable tree languages

2011-09-27

arxiv.org/abs/1109.5851v2

LMCS 7 (4:3) 2011

Computer Science

Formal Languages and Automata Theory

Scientific paper

10.2168/LMCS-7(4:3)2011

A regular tree language L is locally testable if membership of a tree in L
depends only on the presence or absence of some fix set of neighborhoods in the
tree. In this paper we show that it is decidable whether a regular tree
language is locally testable. The decidability is shown for ranked trees and
for unranked unordered trees.

Affiliated with

Also associated with

No associations

Rating

A decidable characterization of locally testable tree languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A decidable characterization of locally testable tree languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A decidable characterization of locally testable tree languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-62679