Learning finite cover automata from queries

DOI10.1016/j.jcss.2011.04.002zbMath1332.68101OpenAlexW2171527505MaRDI 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 automataautomata inferencedeterministic finite cover automatalearning from queries

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (5)

A model learning based testing approach for spiking neural P systems ⋮ A model learning based testing approach for kernel P systems ⋮ RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS ⋮ Fundamental results for learning deterministic extended finite state machines from queries ⋮ An intelligent approach for building a secure decentralized public key infrastructure in VANET

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning finite cover automata from queries