scientific article; zbMATH DE number 2087513
From MaRDI portal
Publication:4738314
zbMath1059.68534MaRDI QIDQ4738314
Bernhard Steffen, Oliver Niese, Andreas Hagerer, Hardi Hungar
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2306/23060080.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items (10)
Inferring Canonical Register Automata ⋮ Unnamed Item ⋮ Learning of event-recording automata ⋮ Learning register automata: from languages to program structures ⋮ A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction ⋮ Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys ⋮ Active learning for extended finite state machines ⋮ Automata Learning with Automated Alphabet Abstraction Refinement ⋮ A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
This page was built for publication:
