Polynomial characteristic sets for \(DFA\) identification

DOI10.1016/j.tcs.2012.04.042zbMath1243.68197OpenAlexW1988971847WikidataQ58209335 ScholiaQ58209335MaRDI QIDQ442107

Damián López, Pedro García, Manuel Vázquez de Parga

Publication date: 9 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.042

zbMATH Keywords

grammatical inferenceDFA identification

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Related Items (2)

Minimal consistent DFA from sample strings ⋮ On the Inference of Finite State Automata from Positive and Negative Data

Uses Software

• RFSA

Cites Work

• Unnamed Item
• Unnamed Item
• Universal automata and NFA learning
• Learning regular sets from queries and counterexamples
• Characteristic sets for polynomial grammatical inference
• Recent advances of grammatical inference
• Learning regular languages using RFSAs.
• Queries and concept learning
• Learning Automata Teams
• Complexity of automaton identification from given data
• Language identification in the limit

This page was built for publication: Polynomial characteristic sets for \(DFA\) identification