One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

7 Citations (Scopus)
Original languageUndefined/Unknown
Title of host publicationThird International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings
EditorsAH Dediu, AM Ionescu, C Martin-Vide
Place of PublicationBerlin
PublisherSpringer
Pages740-751
Number of pages12
ISBN (Print)978-3-642-00981-5
Publication statusPublished - 2009
EventLATA 2009 - Berlin
Duration: 2 Apr 20098 Apr 2009

Publication series

Name
PublisherSpringer
NameLecture Notes in Computer Science
Volume5457
ISSN (Print)0302-9743

Conference

ConferenceLATA 2009
Period2/04/098/04/09

Keywords

  • CWTS JFIS < 0.75

Cite this

Verwer, SE., de Weerdt, MM., & Witteveen, C. (2009). One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit. In AH. Dediu, AM. Ionescu, & C. Martin-Vide (Eds.), Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings (pp. 740-751). (Lecture Notes in Computer Science; Vol. 5457). Springer.