On the inference of Turing machines from sample computations

Artificial Intelligence

Volumn 3, Issue C, 1972, Pages 181-198

  Biermann, A W ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - SUBROUTINES;

AUTOMATA THEORY;

EID: 0015390293     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(72)90048-3     Document Type: Article

References (24)

1. On the automatic formation of a computer program which represents a theory
2. Representations and modelling in problems of program formation
3. On the synthesis of finite-state machines from samples of their behavior
4. A survey of results in grammatical inference
5. First thoughts on grammatical inference
6. Some decidability results on grammatical inference and complexity
7. Grammatical Complexity and Inference
8. Total complexity and the inference of best programs
9. Realization of input-output relations by sequential machines
10. Synthesis of minimal-state machines
11. Language identification in the limit
12. A study of grammatical inference
13. Toward automatic program synthesis
14. Some studies in machine learning using the game of checkers II—recent progress
15. Experiments with a deductive question-answering program
16. A formal theory of inductive inference
17. A formal theory of inductive inference
18. PROW: A Step Toward Automatic Program Writing