A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data

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

Volumn 6339 LNAI, Issue , 2010, Pages 203-216

  Verwer, Sicco ^a   De Weerdt, Mathijs ^b   Witteveen, Cees ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL DATA; DETERMINISTIC FINITE STATE AUTOMATA; EFFICIENT ALGORITHM; EVENT SEQUENCE; LIKELIHOOD-RATIO TEST; POSITIVE DATA; REAL-TIME IDENTIFICATION; REAL-WORLD; TIME AUTOMATA; TIME CONSTRAINTS;

ALGORITHMS; COMPUTATIONAL GRAMMARS; FINITE AUTOMATA; STATISTICAL TESTS; TRANSLATION (LANGUAGES);

REAL TIME SYSTEMS;

EID: 78149269415     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15488-1_17     Document Type: Conference Paper

References (12)

1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183-235 (1994)
2. Carrasco, R., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 139-150. Springer, Heidelberg (1994)
3. Clark, A., Thollard, F.: PAC-learnability of probabilistic deterministic finite state automata. Journal of Machine Learning Research 5, 473-497 (2004)
4. de la Higuera, C.: A bibliographical study of grammatical inference. Pattern Recognition 38(9), 1332-1348 (2005)
5. Dima, C.: Real-time automata. Journal of Automata, Languages and Combinatorics 6(1), 2-23 (2001)
6. Guédon, Y.: Estimating hidden semi-Markov chains from discrete sequences. Journal of Computational and Graphical Statistics 12(3), 604-639 (2003)
7. Hays, W.L.: Statistics, 5th edn. Wadsworth Pub Co. (1994)
8. Kermorvant, C., Dupont, P.: Stochastic grammatical inference with multinomial tests. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 149-160. Springer, Heidelberg (2002)
9. Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, pp. 1-12. Springer, Heidelberg (1998)
10. Sipser, M.: Introduction to the Theory of Computation. PWS Publishing (1997)
11. Verwer, S., de Weerdt, M., Witteveen, C.: An algorithm for learning real-time automata. In: Benelearn, pp. 128-135 (2007)
12. Verwer, S., de Weerdt, M., Witteveen, C.: One-clock deterministic timed automata are efficiently identifiable in the limit. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 740-751. Springer, Heidelberg (2009)