Inference of reversible languages (1982)

View PDF

Download Links

by Dana Angluin , Yale Untverstty
Venue:Journal of the ACM, JACM
Citations:193 - 5 self

Active Bibliography

43 Probabilistic Syntax – Christopher D. Manning - 2002
34 The sk-strings method for inferring PFSA – Anand Raman, Jon Patrick, Palmerston North - 1997
24 Learning of Context-Free Languages: A Survey of the Literature – Lillian Lee - 1996
8 String Extension Learning – Jeffrey Heinz - 2009
7 Generating grammars for SGML tagged texts lacking DTD – Helena Ahonen, Heikki Mannila, Erja Nikunen - 1994
4 An Algorithm To Verify Local Threshold Testability Of Deterministic Finite Automata – A. N. Trahtman - 1999
4 Decompositions of automata and transition semigroups – Tatjana Petković, Miroslav Ćirić, Stojan Bogdanović - 1998
2 estimation on the order of local testability of finite automata – A. N. Trahtman
Michael Kearns Harvard University Recent Results on Boolean Concept Learning – Ming Li, Leonard Pitt