What is the search space of the regular inference?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 862 LNAI, Issue , 1994, Pages 25-37

  Dupont, P ^a   Miclet, L ^a,b   Vidal, E ^c  

^a ORANGE LABS   (France)

^b UNIVERSITÉ DE RENNES 1   (France)

^c UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

GENERAL SOLUTIONS; LANGUAGE IDENTIFICATION; NEGATIVE SAMPLES; REGULAR INFERENCE; SEARCH SPACES; STRUCTURAL COMPLETENESS;

COMPUTATIONAL GRAMMARS;

EID: 84959027544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58473-0_134     Document Type: Conference Paper

References (19)

1. A. Aho and J. Ullman, The Theory of Parsing, Translation and Compiling, Vol. 1: Parsing, Series in Automatic Computation, Prentice-Hall, Englewood, Cliffs, 1972.
2. D. Angluin, On the Complexity of Minimum Inference of Regular Sets, Information and Control, Vol. 39, pp. 337–350, 1978.
3. D. Angluin, Inference of Reversible Languages, Journal of the ACM, Vol. 29, No. 3, pp. 741–765, 1982.
4. K.S. Fu and T.L. Booth, Grammatical Inference: Introduction and Survey, IEEE Transactions on SMC, Part 1: Vol. 5, pp. 85–111, Part 2: Vol. 5, pp. 409–423, 1975.
5. P. Garcia and E. Vidal, Inference of K-testable languages in the strict sense and applications to syntactic pattern recognition, IEEE Transactions on PAMI, Vol. 12, No. 9, pp. 920–925, 1990.
6. J. Gregor, Data-driven Inductive Inference of Finite-state Automata, International Journal of Pattern Recognition and Artificial Intelligence, Vol. 8, No. 1, pp. 305–322, 1994.
7. E.M. Gold, Language Identification in the Limit, Information and Control, Vol. 10, No. 5, pp. 447–474, 1967.
8. E.M. Gold, Complexity of Automaton Identification from Given Data, Information and Control, Vol. 37, pp. 302–320, 1978.
9. M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Massachusetts, 1978.
10. M. Kearns and L. Valiant, Cryptographic Limitations on Learning Boolean Formulae and Finite Automata, Proc. of the 21st ACM Symposium on Theory of Computing, pp. 433–444, 1989.
11. K.J. Lang, Random DFA's can be Approximately Learned from Sparse Uniform Examples, Proc. of the 5th ACM workshop on Computational Learning Theory, pp. 45–52, 1992.
12. L. Miclet, Inférence de Grammaires Régulières, Thèse de Docteur-Ingénieur, E.N.S.T., Paris, France, 1979.
13. L. Miclet, Regular Inference with a Tail-Clustering Method, IEEE Trans. on SMC, Vol. 10, pp. 737–743, 1980.
14. L. Miclet and C. de Gentile, Inférence Grammaticale à partir d'Exemples et de Contre-Exemples: deux Algorithmes Optimaux (BIG et RIG) et une Version Heuristique (BRIG), Actes des JFA-94, Strasbourg, France, pp. F1–F13, 1994.
15. S. Muggleton, Induction of Regular Languages from Positive Examples, Turing Institute Report, TIRM-84-009, 1984.
16. J. Oncina and P. Garcia, Inferring Regular Languages in Polynomial Update Time, Pattern Recognition and Image Analysis, N. Perrez de la Blanca, A. Sanfeliu and E. Vidal (editors), Series in Machine Perception and Artificial Intelligence, Vol. 1, pp. 49–61, World Scientific, 1992.
17. L. Pitt, Inductive Inference, DFA's, and Computational Complexity, Lecture Notes in Artificial Intelligence, K.P. Jantke (editor), No. 397, Springer-Verlag, Berlin, pp. 18–44, 1989.
18. L. Pitt and M. Warmuth, The Minimum Consistent DFA Problem Cannot be Approximated Within any Polynomial, Tech. Report UIUCDCS-R-89-1499, University of Illinois, 1989.
19. B. Trakhtenbrot and Ya. Barzdin, Finite Automata: Behavior and Synthesis, North Holland Pub. Comp., Amsterdam, 1973.