A solution of the syntactical induction-inference problem for regular languages

Computer Languages

Volumn 3, Issue 1, 1978, Pages 53-64

  Pao, Tsyh Wen ^a   Carr III, John W ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Automata theory; Computer learning; Grammatical inference; Languages; Regular grammars; Teacher Pupil interaction

Indexed keywords

EID: 0004787268     PISSN: 00960551     EISSN: None     Source Type: Journal    
DOI: 10.1016/0096-0551(78)90006-1     Document Type: Article

References (43)

1. The syntax and semantics of the proposed international language of the Zurich ACM-Gamm Conference
2. Prolegomena to a theory of signal switching networks
3. Formulation of the problem
4. First thoughts on grammatical inference
5. Program to induce a minimum state machine
6. Induction
7. Gedanken experiments on sequential machines
8. A solution of the suntactical induction-inference problem for a non-trivial subset of contest-free language
9. Finite automata and their decision problems
10. The mechanization of linguistic learning
11. A new method for discovering the grammars of phrase structure languages
12. An extension of the theory of learning systems
13. Realization of input-output relations by sequential machines
14. The realization of consistent input-output sequences by finite state machines
15. Synthesis of minimal-state machines
16. Knowledge and reasoning in program synthesis
17. First thoughts on grammatical inference
18. A study of Grammatical Inference
19. Reduction of enumeration in grammar acquisition
20. An effective model for grammar inference
21. A syntactic pattern recognition system with learning capability
22. learning production systems from examples
23. On the inference of tuning machines from samples computations
24. A system for program synthesis from examples
25. Constructing programs from example computations
26. Automatic program synthesis report
27. Language identification in the limit
28. Current approaches to the inference of phrase structure grammars
29. A new method for discovering the grammars of phrase structure languages
30. A computer model of simple forms of learning
31. Learning structural descriptions from examples
32. Approaches to automatic programming
33. Example grammars: techniques for restricting context-free derivation sets
34. A state automaton as model of a learning system which can learn any machine from a class of finite state machines
35. Kommunikation mit Automaten
36. Graph representations for logic machines
37. Events and conditions