A solution of the syntactical induction-inference problem for regular languages
References (43)
- et al.
The realization of consistent input-output sequences by finite state machines
Inf. Control
(1976) learning production systems from examples
Artif. Intelligence
(1976)On the inference of tuning machines from samples computations
Artif. Intelligence
(1972)Approaches to automatic programming
The syntax and semantics of the proposed international language of the Zurich ACM-Gamm Conference
Prolegomena to a theory of signal switching networks
- et al.
A survey of Modern Algebra
(1954) Formulation of the problem
First thoughts on grammatical inference
Stanford Artificial Intelligence Memo No. 55
(August 1967)Introduction to Switching and Automata Theory
(1965)
Program to induce a minimum state machine
Induction
Gedanken experiments on sequential machines
A solution of the suntactical induction-inference problem for a non-trivial subset of contest-free language
Finite automata and their decision problems
I.B.M. J.
(1959)
The Genesis of Language—A Psycho-Linguistic Approach
(1966)
The mechanization of linguistic learning
A new method for discovering the grammars of phrase structure languages
Theorie der Lernsysteme
(1972)
An extension of the theory of learning systems
Acta Informatica
(1974)
Realization of input-output relations by sequential machines
J. Assoc. Comput. Machinery
(1966)
Cited by (22)
IIPS: A framework for specifying inductive-inference problems
1992, Applied Mathematics LettersIdentification of pattern languages from examples and queries
1987, Information and ComputationInference of deterministic one-counter languages
1984, Information SciencesA note on the number of queries needed to identify regular languages
1981, Information and ControlActive learning for software engineering
2019, Onward! 2019 - Proceedings of the 2019 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, co-located with SPLASH 2019
Copyright © 1978 Published by Elsevier Ltd.