21 search results - page 1 / 5 » A Decidable Characterization of Locally Testable Tree Langua... |
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
LICS
2008
IEEE
14 years 5 months ago
2008
IEEE
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
PODS
2008
ACM
14 years 11 months ago
2008
ACM
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
IPL
2007
13 years 10 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
JIIS
2008
13 years 10 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...