String extension learning using lattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6031 LNCS, Issue , 2010, Pages 380-391

  Kasprzik, Anna ^a   Kötzing, Timo ^b  

^a UNIVERSITY OF TRIER   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LANGUAGE LEARNING MODELS; PATTERN LANGUAGES; POSITIVE DATA; REGULAR LANGUAGES; USEFUL PROPERTIES;

LEARNING SYSTEMS; LINGUISTICS; QUERY LANGUAGES; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 77953805561     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13089-2_32     Document Type: Conference Paper

References (22)

1. Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117-135 (1980)
2. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75, 87-106 (1987)
3. Bārzdi̧nš, J.: Inductive inference of automata, functions and programs. In: Proceedings of the 20th International Congress of Mathematicians, Vancouver, Canada, pp. 455-560 (1974); English translation in American Mathematical Society Translations 2, 109, 107-112 (1977)
4. Birkhoff, G.: Lattice Theory. American Mathematical Society, Providence (1984)
5. Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Information and Control 28, 125-155 (1975)
6. Case, J., Jain, S., Lange, S., Zeugmann, T.: Incremental concept learning for bounded data mining. Information and Computation 152, 74-110 (1999)
7. de Brecht, M., Kobayashi, M., Tokunaga, H., Yamamoto, A.: Inferability of closed set systems from positive data. In: Washio, T., Satoh, K., Takeda, H., Inokuchi, A. (eds.) JSAI 2006. LNCS (LNAI), vol.4384, pp. 265-275. Springer, Heidelberg (2007)
8. de la Higuera, C.: Grammatical Inference. Cambridge University Press, Cambridge (2010) (in Press)
9. Fernau, H.: Identification of function distinguishable languages. Theoretical Computer Science 290(3) (2003)
10. Fulk, M.: A Study of Inductive Inference Machines. PhD thesis, SUNY at Buffalo (1985)
11. Gold, E.: Language identification in the limit. Information and Control 10, 447-474 (1967)
12. Heinz, J.: String extension learning (2009), http://phonology.cogsci. udel.edu/~heinz/papers/heinz-sel.pdf
13. Jain, S., Osherson, D., Royer, J., Sharma, A.: Systems that Learn: An Introduction to Learning Theory, 2nd edn. MIT Press, Cambridge (1999)
14. Jantke, K.P.: Monotonic and non-monotonic inductive inference. New Generation Computing 8(4) (1991)
15. Lange, S., Wiehagen, R.: Polynomial time inference of arbitrary pattern languages. New Generation Computing 8, 361-370 (1991)
16. Nation, J.: Notes on lattice theory (2009), http://www.math.hawaii.edu/ ~jb/books.html
17. Osherson, D., Stob, M., Weinstein, S.: Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge (1986)
18. Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York (1967); Reprinted by MIT Press, Cambridge, Massachusetts (1987)
19. Royer, J., Case, J.: Subrecursive Programming Systems: Complexity and Succinctness. In: Research monograph in Progress in Theoretical Computer Science. Birkhäuser, Boston (1994)
20. Weinstein, S.: Private communication at theWorkshop on Learnability Theory and Linguistics. University of Western Ontario (1982)
21. Wexler, K., Culicover, P.: Formal Principles of Language Acquisition. MIT Press, Cambridge (1980)
22. Wiehagen, R.: Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Elektronische Informationsverarbeitung und Kybernetik 12, 93-99 (1976)