| Abstract | .... 3 | |
| 1 | Introduction | .... 4 |
| 2 | Basic Definitions | .... 6 |
| 3 | Structural Identification | .... 15 |
| 4 | Condition for Learning from Positive Samples | .... 16 |
| 5 | Reversible Context-Free Grammars | .... 17 |
| 6 | Learning Algorithms | .... 23 |
| 6.1 | The Learning Algorithm RT for Tree Automata | .... 23 |
| 6.2 | Correctness of RT | .... 26 |
| 6.3 | Time Complexity of RT | .... 29 |
| 6.4 | Identification in the Limit of Reversible Tree Automata | .... 29 |
| 6.5 | The Learning Algorithm RC for Context-Free Grammars | .... 32 |
| 7 | Example Runs | .... 34 |
| 7.1 | Simple Natural Language | .... 34 |
| 7.2 | Programming Language | .... 34 |
| 7.3 | Inherently Ambiguous Language | .... 38 |
| 8 | Concluding Remarks | .... 39 |
| End | .... 42 |
ICOT研究論文(TR)一覧に戻る / Back to the list of ICOT Technical Reports