Learning Regular Languages Using Nondeterministic Finite Automata

DOI10.1007/978-3-540-70844-5_10MaRDI QIDQ3602804zbMATH OpenOpenAlexFDO

Authors

Publication date 12 February 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-70844-5_10

Mathematics Subject Classification ID

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

Recommendations

• A Family of Algorithms for Non Deterministic Regular Languages Inference
• Universal automata and NFA learning
• Parallel algorithms for minimal nondeterministic finite automata inference
• Grammatical Inference: Algorithms and Applications
• scientific article; zbMATH DE number 1670711

Cited in

(27)

• Algorithms for learning regular expressions from positive data
• Learning regular languages from counterexamples
• Inferring regular languages and \(\omega\)-languages
• Learning algorithms
• Learning infinite-word automata with loop-index queries
• Inference of regular languages using state merging algorithms with search
• scientific article; zbMATH DE number 1670711 (Why is no real title available?)
• scientific article; zbMATH DE number 1670717 (Why is no real title available?)
• Demonstrating Learning of Register Automata
• scientific article; zbMATH DE number 2089448 (Why is no real title available?)
• Regular inference as vertex coloring
• Identification of automata by sequential learning
• Learning symbolic automata
• Learning Commutative Regular Languages
• Inferring regular trace languages from positive and negative samples
• scientific article; zbMATH DE number 2019592 (Why is no real title available?)
• scientific article; zbMATH DE number 2019593 (Why is no real title available?)
• scientific article; zbMATH DE number 2080921 (Why is no real title available?)
• Active learning of nondeterministic finite state machines
• Regular inference as vertex coloring
• Parallel algorithms for minimal nondeterministic finite automata inference
• Grammatical Inference: Algorithms and Applications
• Grammatical Inference: Algorithms and Applications
• A Family of Algorithms for Non Deterministic Regular Languages Inference
• 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: Learning Regular Languages Using Nondeterministic Finite Automata

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