Learning regular languages using RFSAs.

DOI10.1016/J.TCS.2003.11.008zbMATH Open1059.68058OpenAlexW2095745830MaRDI QIDQ1426151FDOQ1426151

Authors: François Denis, Aurélien Lemay, Alain Terlutte 

Publication date: 14 March 2004

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

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

Recommendations

• scientific article; zbMATH DE number 2080668
• scientific article; zbMATH DE number 1670711
• scientific article; zbMATH DE number 1886068
• scientific article; zbMATH DE number 1688359
• Implementation and Application of Automata

zbMATH Keywords

Machine learningRegular languagesGrammatical inferenceFinite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Derivatives of Regular Expressions
• Learning regular sets from queries and counterexamples
• Title not available (Why is that?)
• Complexity of automaton identification from given data
• Characteristic sets for polynomial grammatical inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (20)

• Learning residual alternating automata
• On locally reversible languages
• On the efficient construction of quasi-reversible automata for reversible languages
• Title not available (Why is that?)
• Learning residual finite-state automata using observation tables
• Universal automata and NFA learning
• Polynomial characteristic sets for \(DFA\) identification
• Title not available (Why is that?)
• A sufficient condition to polynomially compute a minimum separating DFA
• Identification of birfsa languages.
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Inference of Finite State Automata from Positive and Negative Data
• Parallel algorithms for minimal nondeterministic finite automata inference
• Learning algorithms
• Title not available (Why is that?)
• Learning regular languages from counterexamples
• Implementation and Application of Automata
• Weighted automata are compact and actively learnable
• A polynomial double reversal minimization algorithm for deterministic finite automata

This page was built for publication: Learning regular languages using RFSAs.

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