Learning finite cover automata from queries

DOI10.1016/j.jcss.2011.04.002zbMath1332.68101MaRDI QIDQ414872

Florentin Ipate

Publication date: 11 May 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.04.002

zbMATH Keywords

finite automata; automata inference; deterministic finite cover automata; learning from queries

Mathematics Subject Classification ID

68Q32: Computational learning theory

68Q45: Formal languages and automata

Related Items

RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS, An intelligent approach for building a secure decentralized public key infrastructure in VANET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incremental construction of minimal deterministic finite cover automata
• Bounded sequence testing from deterministic finite state machines
• Learning regular sets from queries and counterexamples
• Automaticity. I: Properties of a measure of descriptional complexity
• Inference of finite automata using homing sequences
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• Bounded Sequence Testing from Non-deterministic Finite State Machines
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• Uniform characterizations of non-uniform complexity measures
• Language identification in the limit
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Computer Aided Verification
• Minimal cover-automata for finite languages