Some decidability results on grammatical inference and complexity

Information and Control

Volumn 20, Issue 3, 1972, Pages 244-262

  Feldman, Jerome ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY - GRAMMARS;

AUTOMATA THEORY;

EID: 0015316806     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(72)90424-X     Document Type: Article

References (32)

1. Speed up theorems and incompleteness theorems
2. A Survey of Grammatical Inference
3. A machine-independent theory of the complexity of recursive functions
4. On the size of machines
5. Formal analysis of natural languages
6. An Effective Mode for Grammar Inference
7. Reduction of Enumeration in Grammar Acquisition
8. A Grammar Controlled Pattern Analyzer
9. First Thoughts on Grammatical Inference
10. Limiting recursion
11. Language identification in the limit
12. An overview of computational complexity
13. A Study of Grammatical Inference
14. Mechanization of inductive inference in organic chemistry
15. Linguistic Methods in Picture Processing, A Survey
16. Heuristic search: Ill-structured problems
17. On the efficiency of algorithms
18. Some sequence extrapolating programs
19. A remark on discovery algorithms for grammars
20. A new method for discovering the grammars of phase structure languages
21. A formal theory of inductive inference
22. A formal theory of inductive inference
23. Information-theoretical aspects of inductive and deductive inference
24. Toward a theory of enumerations