Identification of dfa: Data-dependent versus data-independent algorithms

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

Volumn 1147, Issue , 1996, Pages 313-325

  De La Higuera, C ^a   Oncina, J ^b   Vidal, E ^c  

^a LIRMM   (France)

^b UNIVERSITY OF ALICANTE   (Spain)

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

Author keywords

Dfa; Grammatical inference; Identification in the limit

Indexed keywords

COMPUTATIONAL GRAMMARS;

CHARACTERISTIC SET; CORRECT SOLUTION; DATA DEPENDENT; DATA-DEPENDENT ALGORITHMS; DETERMINISTIC FINITE AUTOMATA; GRAMMATICAL INFERENCES; IDENTIFICATION IN THE LIMITS;

ALGORITHMS;

EID: 84943228856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0033365     Document Type: Conference Paper

References (20)

1. Angluin D. (1987). Queries and concept learning. Machine Learning 2, 319-342.
2. Dupont P., Miclet L. & Vidal E. (1994). What is the search space of the regular inference? Proceedings of the International Colloquium on Grammatical Inference ICGI-9A (pp. 25-37). Lecture Notes in Artificial Intelligence 862, Springer-Verlag. Edited by R. Carrasco and J. Oncina.
3. Dupont P. (1994). Regular Grammatical Inference from positive and negative samples by genetic search: the GIG method. Proceedings of the International Colloquium on Grammatical Inference ICGI-9A (pp. 236-245).Springer-Verlag Series in Artificial Intelligence 862. Edited by R. Carasco and J. Oncina.
4. Gold E.M. (1967). Language identification in the limit. Inform.&Control. 10, 447-474.
5. Gold E.M. (1978). Complexity of Automaton Identification from given Data. Information and Control 37,302-320.
6. Harrison M.A. (1978). Introduction to Formal Language Theory. Reading: Addison-Wesley.
7. de la Higuera C. (1995). Characteristic sets for Grammatical Inference. In Proceedings of the International Colloquium on Grammatical Inference ICGI-96.
8. Koshiba, T., Makinen, E. & Takada, Y. (1995). Learning Deterministic Even Linear Languages from Positive Examples. Proceedings of ALT '95, Lecture Notes in Artificial Intelligence 997, Springer-Verlag.
9. Lang KJ. (1992). Random DFA's can be approximately Learned from Sparse Uniform Examples, Proceedings of COLT 1992, pp 45-52.
10. Miclet L. & de Gentile C. Inference Grammaticale a partir d’Exemples et de Contre-exemples: deux algorithmes optimaux (BIG et RIG) et une version Heuristique (BRIG), Actes desJFA-94, Strasbourg, France, pp. F1-F13,1994.
11. Oncina J. & Garcia P. (1992) Inferring Regular Languages in Polynomial Updated Time. In Pattern Recognition and Image Analysis, World Scientific (49-61).
12. Oncina J., Garcia P. & Vidal E. (1993). Learning subsequential transducers for pattern recognition tasks. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 448-458.
13. Pitt, L. (1989). Inductive inference, dfas and computational complexity. Proceedings of the International Workshop on Analogical and Inductive Inference (pp. 18-44). Lecture Notes in Artificial Intelligence 397, Springer-Verlag.
14. Sempere J.M. & Garcia P. (1994). A characterisation of Even Linear Languages and its application to the Learning Problem. Proceedings of the International Colloquium on Grammatical Inference 1CGI-9A (pp. 38-44). Lecture Notes in Artificial Intelligence 862, Springer-Verlag.
15. Sakakibara Y. (1992). Efficient Learning of Context-free Grammars from Positive Structural Examples. Inf. and Comp. 97, 23-60.
16. Takada Y. (1988). Grammatical inference for even Linear languages based on control sets. Information Processing Letters 28, 193-199.
17. Takada Y. (1994). A Hierarchy of Language Families Leamable by Regular Language Learners. Proceedings of the International Colloquium on Grammatical Inference ICGI-9A (pp. 16-24). Lecture Notes in Artificial Intelligence 862, Springer-Verlag.
18. Tomita M. (1982). Dynamic construction of Finite Automata from Examples Using Hill Climbing, Proc. of the 4th annual Cognitive Science Conference, USA, pp. 105-108.,
19. Trakhenbrot B. & Barzdin Y.(1973). Finite automata: Behavior and Synthesis. North Holland Pub., Amsterdam.
20. Yokomori T. (1993). Learning non deterministic Finite Automata from queries and Counterexamples. Machine Intelligence 13. Furukawa, Michie & Muggleton eds., Oxford Univ. Press.