An incremental learning algorithm for extended mealy automata

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

Volumn 7609 LNCS, Issue PART 1, 2012, Pages 488-504

  Meinke, Karl ^a   Niu, Fei ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

algebraic automata theory; computational learning theory; finite state machine; initial algebra; Mealy automaton; string rewriting

Indexed keywords

ALGEBRAIC APPROACHES; COMPUTATIONAL LEARNING THEORY; FINITE STATE; INCREMENTAL LEARNING; INFINITE STATE; INITIAL ALGEBRAS; LOOP STRUCTURE; MEALY AUTOMATON; STRING REWRITING;

ALGEBRA; LEARNING ALGORITHMS;

FINITE AUTOMATA;

EID: 84868298586     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34026-0_36     Document Type: Conference Paper

References (20)

1. Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control 51(1), 76-87 (1981)
2. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(1), 87-106 (1987)
3. Balcazar, J.L., Diaz, J., Gavalda, R.: Algorithms for learning finite automata from queries. In: Advances in Algorithms, Languages and Complexity, pp. 53-72. Kluwer (1997)
4. de la Higuera, C.: Grammatical Inference. Cambridge University Press (2010)
5. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Handbook of Theoretical Computer Science. North-Holland (1990)
6. Dupont, P.: Incremental Regular Inference. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS (LNAI), vol. 1147, pp. 222-237. Springer, Heidelberg (1996)
7. Gold, E.M.: Language identification in the limit. Information and Control 10(5), 447-474 (1967)
8. Goguen, J.A., Meseguer, J.: Initiality, induction and computability. In: Algebraic Methods in Semantics, pp. 460-541. Cambridge University Press (1985)
9. Klop, J.W.: Term rewriting systems. In: Handbook of Logic in Computer Science, vol. 2, pp. 2-117. Oxford University Press (1992)
10. Knuth, D.E., Bendix, P.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra, pp. 263-269. Pergamon Press (1970)
11. Lang, K.J.: Random dfa's can be approximately learned from sparse uniform examples. In: Fifth ACM Workshop on Computational Learning Theory, pp. 45-52. ACM Press (1992)
12. Lloyd, J.W.: Foundations of Logic Programming. Springer (1993)
13. Meinke, K.: CGE: A Sequential Learning Algorithm for Mealy Automata. In: Sempere, J.M., García, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 148-162. Springer, Heidelberg (2010)
14. Meinke, K., Niu, F.: Learning-Based Testing for Reactive Systems Using Term Rewriting Technology. In: Wolff, B., Zaïdi, F. (eds.) ICTSS 2011. LNCS, vol. 7019, pp. 97-114. Springer, Heidelberg (2011)
15. Meinke, K., Niu, F., Sindhu, M.: Learning-based software testing: a tutorial. In: Proc. Int. ISoLAWorkshop on Machine Learning for Software Construction. CCIS. Springer (2012)
16. Meinke, K., Sindhu, M.A.: Incremental Learning-Based Testing for Reactive Systems. In: Gogolla, M., Wolff, B. (eds.) TAP 2011. LNCS, vol. 6706, pp. 134-151. Springer, Heidelberg (2011)
17. Meinke, K., Tucker, J.V.: Universal algebra. In: Handbook of Logic in Computer Science, vol. 1, pp. 189-411. Oxford University Press (1993)
18. Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: Pattern Recognition and Image Analysis. Series in Machine Perception and Artificial Intelligence. World Scientific (1992)
19. Parekh, R., Honavar, V.: Grammar inference, automata induction and language acquisition. In: Handbook of Natural Language Processing, Marcel Dekker (2000)
20. Parekh, R.G., Nichitiu, C., Honavar, V.G.: A Polynomial Time Incremental Algorithm for Learning DFA. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, pp. 37-49. Springer, Heidelberg (1998)