Learning algorithms
From MaRDI portal
Summary: For the entire collection see [Zbl 1470.68001].
Recommendations
Cites work
- A characterization for decidable separability by piecewise testable languages
- A Family of Algorithms for Non Deterministic Regular Languages Inference
- A theory of the learnable
- Adaptive Model Checking
- Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
- Characteristic sets for polynomial grammatical inference
- Characterizing XML twig queries with examples
- Complexity of automaton identification from given data
- Complexity of decision problems for XML schemas and chain regular expressions
- Containment and equivalence for a fragment of XPath
- Deciding piecewise testable separability for regular tree languages
- Derivatives of Regular Expressions
- Efficient separability of regular languages by subsequences and suffixes
- Grammatical inference. Learning automata and grammars.
- Grammatical Inference: Algorithms and Applications
- scientific article; zbMATH DE number 1670726 (Why is no real title available?)
- scientific article; zbMATH DE number 5854939 (Why is no real title available?)
- scientific article; zbMATH DE number 3427224 (Why is no real title available?)
- scientific article; zbMATH DE number 1351094 (Why is no real title available?)
- scientific article; zbMATH DE number 615131 (Why is no real title available?)
- scientific article; zbMATH DE number 2040913 (Why is no real title available?)
- scientific article; zbMATH DE number 2079859 (Why is no real title available?)
- scientific article; zbMATH DE number 1886068 (Why is no real title available?)
- scientific article; zbMATH DE number 1916673 (Why is no real title available?)
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Learning context-free grammars from structural data in polynomial time
- Learning deterministically recognizable tree series
- Learning DFA from simple examples
- Learning Meets Verification
- Learning Minimal Separating DFA’s for Compositional Verification
- Learning Regular Languages Using Nondeterministic Finite Automata
- Learning regular languages using RFSAs.
- Learning regular sets from queries and counterexamples
- Learning Subclasses of Pure Pattern Languages
- Learning two-tape automata from queries and counterexamples
- On the minimization of XML schemas and tree automata for unranked trees
- On the regularity and learnability of ordered DAG languages
- PAC learning with simple examples
- Polynomial identification in the limit of substitutable context-free languages
- Queries and concept learning
- Regular separability of one counter automata
- Regular separability of Parikh automata
- Separating regular languages by locally testable and locally threshold testable languages
- Separating regular languages by piecewise testable and unambiguous languages
- Separating regular languages with first-order logic
- Skeletal structural descriptions
- Transducers with Origin Information
- Unambiguous automata inference by means of state-merging methods.
- Universal automata and NFA learning
Cited in
(6)- Feature learning and understanding. Algorithms and applications
- Learning algorithms based on linearization
- scientific article; zbMATH DE number 591894 (Why is no real title available?)
- scientific article; zbMATH DE number 861397 (Why is no real title available?)
- Algorithmic Learning in a Random World
- Liability Regimes in the Age of AI: a Use-Case Driven Analysis of the Burden of Proof
This page was built for publication: Learning algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074213)
