1. Regular grammar prediction from finite positive samples.
- Author
-
Kumar, K. Senthil, Vijaya, K., and Malathi, D.
- Subjects
- *
TIME complexity , *GRAMMAR , *FORECASTING , *ROBOTS - Abstract
Given set of samples grammatical inference aims at finding underlying automaton or equivalent grammar of theunknown language. Traditional approaches to this problem have made use of both positive and negative samples and the least time complexity that has been reported is O(n3). In this paper, O(n4) algorithm is presented that finds the equivalentregular grammar and subsequently the minimal DFA for a specific set of regular languages which uses only a finite set of positive samples of the unknown language. We presented our proposed algorithm with an example. And time complexity computation is derived. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF