Universal automata and NFA learning

DOI10.1016/j.tcs.2008.05.017zbMath1153.68030OpenAlexW2131211586MaRDI QIDQ954990

B. E. Eshmatov

Publication date: 18 November 2008

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

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

zbMATH Keywords

finite automatagrammatical inferenceuniversal automaton

Mathematics Subject Classification ID

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

Related Items (7)

The universal fuzzy automaton ⋮ On quotients of formal power series ⋮ Polynomial inference of universal automata from membership and equivalence queries ⋮ On the Inference of Finite State Automata from Positive and Negative Data ⋮ Polynomial characteristic sets for \(DFA\) identification ⋮ Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference ⋮ Learning algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning regular languages using RFSAs.
• Complexity of automaton identification from given data
• Implementation and Application of Automata
• Grammatical Inference: Algorithms and Applications
• Language identification in the limit
• A Family of Algorithms for Non Deterministic Regular Languages Inference
• Machine Learning: ECML 2003

This page was built for publication: Universal automata and NFA learning