| An algorithm for constructing an even grammar from a language sample |
| Full text |
Pdf
(493 KB)
|
| Source
|
ACM Southeast Regional Conference
archive
Proceedings of the 42nd annual Southeast regional conference
table of contents
Huntsville, Alabama
SESSION: Theory & human computer interaction & programming languages
table of contents
Pages: 240 - 245
Year of Publication: 2004
ISBN:1-58113-870-9
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 8, Downloads (12 Months): 15, Citation Count: 1
|
|
|
ABSTRACT
Two skeleton based algorithms are presented for the grammatical inference problem. The first demonstrates the use of a new relation on internal skeleton nodes that focuses on decedent information. The second addresses those positive samples that contain repeated substrings.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
M. Francel and D. John. Skeleton properties that guarantee a certain relationship between a language and an inference of the language, Proceedings of the 41st Southeastern Regional Meeting of the ACM, Mark Burge, editor, ACM Press 2003, pages 183--187.
|
| |
3
|
K. Fu and T. L. Booth, Grammatical Inference: Introduction and Survey-Part I. IEEE Transactions on Systems, Man, and Cybernetics, SMC-5(1):95--111, January 1975.
|
| |
4
|
K. Fu and T. L. Booth, Grammatical Inference: Introduction and Survey-Part II. IEEE Transactions on Systems, Man, and Cybernetics, SMC-5(4):409--423, July 1975.
|
| |
5
|
E. M. Gold. Language identification in the limit. Inf. Control, 10:447--474, 1967.
|
| |
6
|
John E. Hopcroft , Rajeev Motwani , Rotwani , Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computability, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2000
|
| |
7
|
|
| |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
|