Inference of finite automata using homing sequences
From MaRDI portal
Publication:2365762
DOI10.1006/inco.1993.1021zbMath0786.68082OpenAlexW2140606869MaRDI QIDQ2365762
Ronald L. Rivest, Robert E. Schapire
Publication date: 29 June 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9a62d26420afc77543c8f17bae1b482bcb28dc66
computational learning theorylearning algorithmmachine learningautonomous robotfinite-state automatonpermutation automatahoming sequence
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items (58)
Inferring Canonical Register Automata ⋮ Compositional Reasoning ⋮ AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee ⋮ Learning fallible deterministic finite automata ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Learning to verify branching time properties ⋮ Efficient learning of typical finite automata from random walks ⋮ Learning of event-recording automata ⋮ Selection of relevant features and examples in machine learning ⋮ A simple algorithm for learning O(log n)-term DNF ⋮ Regular model checking revisited ⋮ Never-stop context-free learning ⋮ Active model learning of stochastic reactive systems ⋮ Compositional learning for interleaving parallel automata ⋮ Active automata learning as black-box search and lazy partition refinement ⋮ Learning finite cover automata from queries ⋮ Map learning with uninterpreted sensors and effectors ⋮ Learning and characterizing fully-ordered lattice automata ⋮ A survey of model learning techniques for recurrent neural networks ⋮ A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages ⋮ The Birth of Model Checking ⋮ Learning Grammars and Automata with Queries ⋮ Fingerprinting and analysis of Bluetooth devices with automata learning ⋮ Unnamed Item ⋮ Active learning of nondeterministic finite state machines ⋮ A succinct canonical register automaton model ⋮ Learning register automata: from languages to program structures ⋮ \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition ⋮ Three optimizations for assume-guarantee reasoning with \(L^{*}\) ⋮ Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning ⋮ Verification of evolving software via component substitutability analysis ⋮ Automatic symbolic compositional verification by learning assumptions ⋮ Learning Mealy machines with one timer ⋮ A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees ⋮ \(L^\ast\)-based learning of Markov decision processes (extended version) ⋮ Classic learning ⋮ Compositional CSP Traces Refinement Checking ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction ⋮ Automated Compositional Reasoning of Intuitionistically Closed Regular Properties ⋮ Model-based learning of interaction strategies in multi-agent systems ⋮ Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys ⋮ Grey-Box Checking ⋮ Learning Minimal Separating DFA’s for Compositional Verification ⋮ Active learning for extended finite state machines ⋮ A Myhill-Nerode theorem for register automata and symbolic trace languages ⋮ Automata Learning with Automated Alphabet Abstraction Refinement ⋮ Enhancing Automata Learning by Log-Based Metrics ⋮ Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists ⋮ AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES ⋮ New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries ⋮ Efficient active automata learning via mutation testing ⋮ An efficient query learning algorithm for ordered binary decision diagrams ⋮ Even linear simple matrix languages: formal language properties and grammatical inference. ⋮ A learning-based synthesis approach to decentralized supervisory control of discrete event systems with unknown plants ⋮ Piecemeal graph exploration by a mobile robot. ⋮ The query complexity of finding local minima in the lattice ⋮ Learning to win process-control games watching game-masters ⋮ The power of a pebble: Exploring and mapping directed graphs
This page was built for publication: Inference of finite automata using homing sequences
