Logical aspects in the study of tree languages
Proc. of the conference on Ninth colloquium on trees in algebra and programming
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Minimal Ascending and Descending Tree Automata
SIAM Journal on Computing
Handbook of formal languages, vol. 3
On learning unions of pattern languages and tree patterns in the mistake bound model
Theoretical Computer Science
Some Classes of Regular Languages Identifiable in the Limit from Positive Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning Regular Languages Using RFSA
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Learning Tree Languages from Text
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
XWRAP: An XML-Enabled Wrapper Construction System for Web Information Sources
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Residual Finite State Automata
Fundamenta Informaticae
Inference of residual finite-state tree automata from membership queries and finite positive data
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Four one-shot learners for regular tree languages and their polynomial characterizability
Theoretical Computer Science
| Hi-index | 0.00 |
Tree automata based algorithms are essential in many fields in computer science such as verification, specification, program analysis. They become also essential for databases with the development of standards such as XML. In this paper, we define new classes of non deterministic tree automata, namely residual finite tree automata (RFTA). In the bottom-up case, we obtain a new characterization of regular tree languages. In the top-down case, we obtain a subclass of regular tree languages which contains the class of languages recognized by deterministic top-down tree automata. RFTA also come with the property of existence of canonical non deterministic tree automata.