E. M. Gold, “Language Identification in the Limit,” Information and Control, Vol. 10, No. 5, 1967, pp. 447-474. doi:10.1016/S0019-9958(67)91165-5

has been cited by the following article:

• TITLE: Formularless Logic Function

  AUTHORS: Alexey Nikolayevitch Teterin

  KEYWORDS: Complexity of Computation(03D15); Models of Computation(68Q05); Analysis of Algorithms and Problem Complexity(68Q25); Computational Learning Theory(68Q32); Separability; Satisfiability; Fuzziness; Dynamical Systems; Computability

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.3 No.1, January 29, 2013

  ABSTRACT: The concept of computability is defined more exactly and illustrated as an example of Boolean functions and cryptanalysis. To define a Boolean function is not necessary to record its formula. To do that the reduced (compact) description of values is determined in the truth table or in the statement of the problem. We obtain estimates of computation time, the volume of a compact descriptions and the range of variables under which it takes the value 0 or 1, depending polynomially on the number of arguments.