Efficiently identifying deterministic real-time automata from labeled data

Author： Verwer Sicco Weerdt Mathijs Witteveen Cees

ISSN： 0885-6125

Source： Machine Learning, Vol.86, Iss.3, 2012-03, pp. : 295-333

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

PLC-automata: a new class of implementable real-time automata

By Dierks

Theoretical Computer Science, Vol. 253, Iss. 1, 2001-02 ,pp. : 61-93

Elsevier

Access to resources Recommend Favorite

On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

By Yokomori T.

Machine Learning, Vol. 19, Iss. 2, 1995-05 ,pp. : 153-179

Springer Publishing Company

Access to resources Recommend Favorite

Deterministic Turing machines in the range between real-time and linear-time

By Klein A. Kutrib M.

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 253-275

Elsevier

Access to resources Recommend Favorite

Analytic real-time analysis and timed automata: a hybrid methodology for the performance analysis of embedded real-time systems

By Lampka Kai

Design Automation for Embedded Systems, Vol. 14, Iss. 3, 2010-09 ,pp. : 193-227

Springer Publishing Company

Access to resources Recommend Favorite

A Comparison of Data Exchange Mechanisms for Real-Time Communication

International Journal of Rough Sets and Data Analysis (IJRSDA), Vol. 4, Iss. 4, 2017-10 ,pp. : 66-81

IGI Global_journal

Access to resources Recommend Favorite