| Autor: |
Thomas Place, Luc Segoufin |
| Jazyk: |
angličtina |
| Rok vydání: |
2011 |
| Předmět: |
|
| Zdroj: |
Logical Methods in Computer Science, Vol Volume 7, Issue 4 (2011) |
| Druh dokumentu: |
article |
| ISSN: |
1860-5974 |
| DOI: |
10.2168/LMCS-7(4:3)2011 |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
