Learning Analysis by Reduction from Positive Data Using Reversible Languages

Abstract

The analysis by reduction is a method for checking correctness of a sentence from a natural language. To model the analysis by reduction so-called restarting automata can be used.

We propose a method for learning a special kind of restarting automata called single zero-reversible restarting automata (S-ZR-RRWW-automata). Interesting learning results achieved by using our implementation of the method are given.

In addition the power of the model is investigated.

Keywords

• Learning
• Analysis
• Reduction
• Positive
• Using
• Reversible
• Languages