Some Decidability Results on Grammatical Inference and Complexity

@article{Feldman1972SomeDR,
  title={Some Decidability Results on Grammatical Inference and Complexity},
  author={Jerome A. Feldman},
  journal={Information and Control},
  year={1972},
  volume={20},
  pages={244-262}
}
The grammatical inference problem is easy to state: One must choose, on the basis of a finite set of symbol strings, a grammar for the language of which the given set is a sample. Precisely the same problem arises in trying to choose a model (theory, function, etc.) to explain a collection of sample data. This is one of the most important information processing problems known and it is surprising that there has been so little work on its formalization. The papers that have been written (e.g… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

On Total Complexity and the E~stence of Best Programs,

CS 255, • 1965
View 7 Excerpts
Highly Influenced

Language Identification in the Limit

Information and Control • 1967
View 3 Excerpts
Highly Influenced

A Survey of Grammatical Inference,

A. CA. BIERMAN, J. FELDMAN
1972

Chomsk¥, N

Department, University of California, Berkeley, May
AND • 1972

An Effective Mode for Grammar Inference,

S. I-REcmZZI
1971

Heuristic search: Ill-structured problems, in "Progress

O R.
Proc. AFIPS FJCC. NEWELL, A • 1969
View 1 Excerpt

Toward a theory of enumerations

P R.
J. ~ICM • 1969
View 1 Excerpt

A machineindependent theory of the complexity of recursive functions

M. BLUM
1967
View 1 Excerpt

On the size of machines, Information and Control 11,257-265

functions, M J.AC
BLUM, M. "Some Results in Learning and Inductive Inference," • 1967

Recursive Functions and Effective Computability,

JR
1967

Similar Papers

Loading similar papers…