One-clock deterministic timed automata are efficiently identifiable in the limit

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

Volumn 5457, Issue , 2009, Pages 740-751

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

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

TIMED AUTOMATA;

CLOCKS; EDUCATION; LINGUISTICS; ROBOTS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 67649949173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00982-2_63     Document Type: Conference Paper

References (9)

1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183-235 (1994)
2. Larsen, K.G., Petterson, P., Yi, W.: Uppaal in a nutschell. International journal on software tools for technology transfer 1(1-2), 134-152 (1997)
3. Gold, E.M.: Complexity of automaton identification from given data. Information and Control 37(3), 302-320 (1978)
4. Pitt, L., Warmuth, M.: The minimum consistent dfa problem cannot be approximated within and polynomial. In: Annual ACM Symposium on Theory of Computing, pp. 421-432. ACM, New York (1989) (Pubitemid 20607057)
5. Gold, E.M.: Language identification in the limit. Information and Control 10(5), 447-474 (1967)
6. Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: Pattern Recognition and Image Analysis. Series in Machine Perception and Artificial Intelligence, Vol. 1, pp. 49-61. World Scientific, Singapore (1992)
7. de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27(2), 125-138 (1997) (Pubitemid 127507782)
8. Verwer, S., de Weerdt, M., Witteveen, C.: Polynomial distinguishability of timed automata. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS, Vol. 5278, pp. 238-251. Springer, Heidelberg (2008)
9. Grinchtein, O., Jonsson, B., Pettersson, P.: Inference of event-recording automata using timed decision trees. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, Vol. 4137, pp. 435-449. Springer, Heidelberg (2006) (Pubitemid 44532591)