Characteristic sets for polynomial grammatical inference
From MaRDI portal
Recommendations
- Polynomial characteristic sets for \(DFA\) identification
- scientific article; zbMATH DE number 2019600
- Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
- Polynomial-time algorithms for learning typed pattern languages
- Polynomial-time identification of very simple grammars from positive data.
Cited in
(33)- Learning grammars and automata with queries
- Learning Left-to-Right and Right-to-Left Iterative Languages
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
- Languages as hyperplanes: grammatical inference with string kernels
- Efficiently identifying deterministic real-time automata from labeled data
- Learning probabilistic automata using residuals
- Learning regular languages using RFSAs.
- The efficiency of identifying timed automata and the power of clocks
- Efficient learning of tier-based strictly \(k\)-local languages
- Learning indexed families of recursive languages from positive data: A survey
- Grammatical inference of directed acyclic graph languages with polynomial time complexity
- Language learning from membership queries and characteristic examples
- Learning efficiency of very simple grammars from positive data
- On the hardness of learning queries from tree structured data
- PAC learning under helpful distributions
- Efficiency in the identification in the limit learning paradigm
- Polynomial characteristic sets for \(DFA\) identification
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Learning mildly context-sensitive languages with multidimensional substitutability from positive data
- Polynomial inference of universal automata from membership and equivalence queries
- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
- Inference of -languages from prefixes.
- Inductive synthesis of cover-grammars with the help of ant colony optimization
- Minimal consistent DFA from sample strings
- Identification in the Limit of k,l-Substitutable Context-Free Languages
- Learning algorithms
- Parallel algorithms for minimal nondeterministic finite automata inference
- Polynomial identification of \(\omega \)-automata
- Inferring Symbolic Automata
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
- LARS: a learning algorithm for rewriting systems
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Learning Efficiency of Very Simple Grammars from Positive Data
This page was built for publication: Characteristic sets for polynomial grammatical inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366803)
