Regular Inference with a Tail-Clustering Method
- 1 January 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 10 (11) , 737-743
- https://doi.org/10.1109/tsmc.1980.4308394
Abstract
A characterization of the solutions to the regular grammatical Infrence problem and an Introduction to a methodology for Infering regular grammars, based on the clutering of the states of a "maximal" solution, are presented. Examples are given with a paricular design of this algorithm.Keywords
This publication has 5 references indexed in Scilit:
- A solution of the syntactical induction-inference problem for regular languagesComputer Languages, 1978
- Grammatical Inference: Introduction and Survey - Part IIEEE Transactions on Systems, Man, and Cybernetics, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974
- On the Synthesis of Finite-State Machines from Samples of Their BehaviorIEEE Transactions on Computers, 1972
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959