Diversity-based inference of finite automata

DOI10.1145/176584.176589MaRDI QIDQ4305673zbMATH OpenOpenAlexFDO

Authors Ronald L. Rivest, Robert E. Schapire

Publication date 10 September 1995

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/176584.176589

zbMATH Keywords

finite-state automatonpermutation automata

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Recommendations

• Inference of finite automata using homing sequences
• Identification of automata by sequential learning
• Efficient learning of typical finite automata from random walks

Cited in

(8)

• Inference of finite automata using homing sequences
• On the Inference of Finite State Automata from Positive and Negative Data
• Learning metric-topological maps for indoor mobile robot navigation
• Efficient learning of typical finite automata from random walks
• The power of a pebble: Exploring and mapping directed graphs
• Reward-respecting subtasks for model-based reinforcement learning
• Models of active learning in group-structured state spaces
• Active Learning of Group-Structured Environments

This page was built for publication: Diversity-based inference of finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305673)