Efficiently identifying deterministic real-time automata from labeled data
type: Item
instance of: scholarly article
title: Efficiently identifying deterministic real-time automata from labeled data
zbMATH Open document ID: 1238.68135
author: Sicco Verwer
author: Mathijs M. de Weerdt
author: Cees Witteveen
published in: Machine Learning
publication date: 2012-05-23T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 6037844
zbMATH Keywords: timed automata
zbMATH Keywords: real-time automata
zbMATH Keywords: identification in the limit
zbMATH Keywords: supervised learning
describes a project that uses: Uppaal
describes a project that uses: PRMLT
MaRDI profile type: Publication
full work available at URL: s10994-011-5265-4
OpenAlex ID: W2133625193
cites work: A theory of timed automata
cites work: Q5483032
cites work: Inference of regular languages using state merging algorithms with search
cites work: Q3093192
cites work: Real-time automata
cites work: Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
cites work: Complexity of automaton identification from given data
cites work: Teaching a smarter learner.
cites work: Inference of Event-Recording Automata Using Timed Decision Trees
cites work: Characteristic sets for polynomial grammatical inference
cites work: Q4440393
cites work: Uppaal in a nutshell
cites work: Q4398828
cites work: KI 2004: Advances in Artificial Intelligence
cites work: Q3392273
cites work: Testing timed automata
cites work: Polynomial Distinguishability of Timed Automata
cites work: One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
cites work: The efficiency of identifying timed automata and the power of clocks
DOI: 10.1007/S10994-011-5265-4
description: scientific article; zbMATH DE number 6037844