Polynomial time inference of extended regular pattern languages
- 1 January 1983
- book chapter
- Published by Springer Nature
- p. 115-127
- https://doi.org/10.1007/3-540-11980-9_19
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Inductive inference of formal languages from positive dataInformation and Control, 1980
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Language identification in the limitInformation and Control, 1967