Inference of Reversible Languages

Journal of the ACM (JACM)

Volumn 29, Issue 3, 1982, Pages 741-765

  Angluin, Dana ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

grammatical mference; Inductive inference; reversible languages

Indexed keywords

EID: 84976832596     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322326.322334     Document Type: Article

References (33)

1. Aho, A V, Hopcroft, J E, and Ullman, J D. Addion-Wesley, Reading, Mass., 1974.
2. Angluin, D On the complexity of minimum inference of regular sets. Inf. Control 39 (1978), 337-350.
3. Angluin, D Finding patterns common to a set of strings J Comput. Syst Sci. 21 (1980), 46-62.
4. Angluin, D Inductive inference of formal languages from positive data Inf Control 45 (1980), 117-135.
5. Biermann, A W, and Feldman, J.A., On the synthesis of finite-state machines from samples of their behavior IEEE Trans. Comput C-21 (1972), 592-597.
6. Blum, L, and Blum, M. Toward a mathematic theory of inductive inference. Inf. Control 28 (1978), 125-155.
7. Case, J., and Smith, C Anomaly hierarchies of mechanized inductive inference. Proc. 10th ACM Symp on Theory of Computing, San Diego, Calif., 1978, pp 314-319.
8. Cohen, R.S., and Brzozowski, J. A. General properties of star height of regular events. J Comput. Syst. Sa 4 (1970), 260-280,.
9. Crespi-Reghizzi, S An effective model for grammar inference. In Information Processing, North Holland, 1972, pp 524-529.
10. Crespi-Reghizzi, S, Guida, G, and Mandrioli, D Noncounting context-free languages. J. ACM 25, 4 (Oct. 1978), 571-580.
11. Feldman, J.A., First thoughts on grammatical inference Tech. Rep., Artificial Intelligence Project, Stanford Univ., Stanford, Calif., 1967.
12. Feldman, J A Some decidability results in grammatical inference Inf. Control 20 (1972), 244-262.
13. Feldman, J.A., Gips, J., Horning, J.J., and Reder, S Grammatical complexity and inference Tech Rep, Computer Science Dep., Stanford Umv, Stanford, Calif, 1969.
14. Fu, K S Syntactic Methods and Pattern Recognition Academic Press, New York, 1975.
15. Fu, K S Syntactic Pattern Recognition, Applications Spnnger-Verlag, New York, 1977.
16. Fu, K S, and Booth, T.L. Grammatical inference Introduction and survey, Part 1 and 2 IEEE Trans. Syst., Man Cybern SMC 5 (1975), 95-111, 409-423.
17. Ginzhurg, A. About some properties of definite, reverse-definite and related automata. IEEE Trans Electron. Comput. IX, 15 (1966), 806-810.
18. Gold, E M Language identification in the limit Inf Control 10 (1967), 447-474.
19. Gold, E.M. Complexity of automaton identification from given data Inf. Control 37 (1978), 302-320.
20. Gonzalez, R.C., and Thomason, M.G. Syntactic Pattern Recognition, An Introduction. Addison-Wesley, Reading, Mass, 1978.
21. Harrison, M.A., Introduction to Switching and Automata Theory. McGraw-Hill, New York, 1968.
22. Harrison, M.A. Introduction to Formal Language Theory Addison-Wesley, Reading, Mass, 1978.
23. Hartmanis, J, and Stearns, R.E., Algebraic Theory of Sequential Machines Prentice-Hall, Englewood Cliffs, N J, 1966.
24. Hopcroft, J E, and Ullman, J.D., Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.
25. Itoga, S Y. A new heuristic for inferring regular grammars. IEEE Trans Pattern Anal. Mach. Intell. PAMI-3(1987), 191-197.
26. McNaughton, R, The loop complexity of pure-group events. Inf. Control 11 (1967), 167-176.
27. McNaughton, R Parenthesis grammars J ACM 14, 3 (July 1967), 490-500.
28. McNaughton, R, and Papert, S Counter-Free Automata M.I.T Press, Cambridge, Mass., 1971.
29. Miclet, L. Regular inferences with a tail-clustering method IEEE Trans Syst, Man Cybern. SMC-10 (1980), 737-743.
30. Perles, M, Rabin, M.O., and Shamir, E. The theory of definite automata. IEEE Trans. Electron Comput EC-12 (1963), 233-243.
31. Smith, C.H., An inductive inference bibliography Tech Rep CSD TR 323, Computer Science Dep., Purdue Umv, Lafayette, Ind, 1979.
32. Tarjan, R E Efficiency of a good but not linear set union algorithm J ACM 22, 2 (Apr 1975), 215-225.
33. Zalcstein, Y Locally testable languages J. Comput. Syst. Sci 6 (1972), 151-167.