Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TSMCB.2004.827190 | IEEE Transactions on Systems, Man, and Cybernetics, Part B |
Keywords | Field | DocType |
pattern recognition,regular tree languages.,polynomial time,inference algorithm,k-testable tree language,tree language class,index terms—grammatical inference,regular tree language,reversible tree language,computational complexity,grammars,grammatical inference,indexing terms,formal languages | Second-generation programming language,Formal language,Grammar induction,Regular tree grammar,Sparse language,Computer science,Inference,Abstract family of languages,Artificial intelligence,Natural language processing,Time complexity,Machine learning | Journal |
Volume | Issue | ISSN |
34 | 4 | 1083-4419 |
Citations | PageRank | References |
10 | 0.61 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Damián López | 1 | 10 | 0.61 |
| José M. Sempere | 2 | 284 | 27.85 |
| Pedro García | 3 | 34 | 3.49 |