DocumentCode
1036403
Title
Inference of reversible tree languages
Author
López, Damián ; Sempere, José M. ; García, Pedro
Author_Institution
Dept. de Sistemas Informaticos y Computacion, Univ. Politecnica of Valencia, Spain
Volume
34
Issue
4
fYear
2004
Firstpage
1658
Lastpage
1665
Abstract
In this paper, we study the notion of k-reversibility and k-testability when regular tree languages are involved. We present an inference algorithm for learning a k-testable tree language that runs in polynomial time with respect to the size of the sample used. We also study the tree language classes in relation to other well known ones, and some properties of these languages are proven.
Keywords
computational complexity; formal languages; grammars; inference mechanisms; pattern recognition; grammatical inference; inference algorithm; pattern recognition; polynomial time; reversible regular tree language; Formal languages; Inference algorithms; Machine learning; Natural languages; Pattern recognition; Polynomials; Testing; Training data; Algorithms; Artificial Intelligence; Natural Language Processing; Pattern Recognition, Automated; Semantics; Vocabulary, Controlled;
fLanguage
English
Journal_Title
Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on
Publisher
ieee
ISSN
1083-4419
Type
jour
DOI
10.1109/TSMCB.2004.827190
Filename
1315749
Link To Document