Diversity-based inference of finite automata

DOI10.1145/176584.176589zbMATH Open0821.68085OpenAlexW1984735703MaRDI QIDQ4305673FDOQ4305673

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

Recommendations

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

zbMATH Keywords

finite-state automatonpermutation automata

Mathematics Subject Classification ID

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

Cited In (8)

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

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)