A Family of Algorithms for Non Deterministic Regular Languages Inference

DOI10.1007/11812128_25MaRDI QIDQ5757244zbMATH OpenOpenAlexFDO

Authors

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812128_25

Mathematics Subject Classification ID

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

Recommendations

• Learning Regular Languages Using Nondeterministic Finite Automata
• Universal automata and NFA learning
• Parallel algorithms for minimal nondeterministic finite automata inference
• On the Inference of Finite State Automata from Positive and Negative Data
• Grammatical Inference: Algorithms and Applications

Cited in

(9)

• Learning algorithms
• scientific article; zbMATH DE number 1670717 (Why is no real title available?)
• Learning Regular Languages Using Nondeterministic Finite Automata
• scientific article; zbMATH DE number 2019592 (Why is no real title available?)
• Parallel algorithms for minimal nondeterministic finite automata inference
• Grammatical Inference: Algorithms and Applications
• Unambiguous automata inference by means of state-merging methods.
• Inference of deterministic one-counter languages
• Universal automata and NFA learning

This page was built for publication: A Family of Algorithms for Non Deterministic Regular Languages Inference

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