Inference of reversible languages (1982)

Cached

Download Links

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

Active Bibliography

Algebraic properties of structured context-free languages: old approaches and . . . – Stefano Crespi Reghizzi , Dino Mandrioli - 2009
21 Learning of Context-Free Languages: A Survey of the Literature – Lillian Lee - 1996
Advances in Learning Formal Languages – Gend Lal Prajapati
2 estimation on the order of local testability of finite automata – A. N. Trahtman
4 Decompositions of automata and transition semigroups – Tatjana Petković, Miroslav Ćirić, Stojan Bogdanović - 1998
8 String Extension Learning – Jeffrey Heinz - 2009
4 An Algorithm To Verify Local Threshold Testability Of Deterministic Finite Automata – A. N. Trahtman - 1999
Probabilistic Approaches to Syntax – Christopher D. Manning - 2001
A Model of Early Syntactic Development – Pat Langley The
6 Generating grammars for SGML tagged texts lacking DTD – Helena Ahonen, Heikki Mannila, Erja Nikunen - 1994
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Bootstrap Learning via Modular Concept Discovery – Eyal Dechter, Jon Malmaud, Ryan P. Adams, Joshua B. Tenenbaum
34 Probabilistic Syntax – Christopher D. Manning - 2002
31 The sk-strings method for inferring PFSA – Anand Raman, Jon Patrick, Palmerston North - 1997