Characteristic sets for polynomial grammatical inference
From MaRDI portal
Publication:1366803
DOI10.1023/A:1007353007695zbMath0884.68107OpenAlexW2137739002MaRDI QIDQ1366803
Publication date: 11 November 1997
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1007353007695
Related Items (31)
Learning probabilistic automata using residuals ⋮ LARS: a learning algorithm for rewriting systems ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Minimal consistent DFA from sample strings ⋮ Inductive synthesis of cover-grammars with the help of ant colony optimization ⋮ Languages as hyperplanes: grammatical inference with string kernels ⋮ Inferring Symbolic Automata ⋮ Polynomial inference of universal automata from membership and equivalence queries ⋮ Efficiently identifying deterministic real-time automata from labeled data ⋮ Efficiency in the Identification in the Limit Learning Paradigm ⋮ Learning Grammars and Automata with Queries ⋮ Concurrent Kleene algebra with observations: from hypotheses to completeness ⋮ Efficient learning of multiple context-free languages with multidimensional substitutability from positive data ⋮ Learning Efficiency of Very Simple Grammars from Positive Data ⋮ Polynomial characteristic sets for \(DFA\) identification ⋮ Learning Left-to-Right and Right-to-Left Iterative Languages ⋮ Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries ⋮ Identification in the Limit of k,l-Substitutable Context-Free Languages ⋮ Learning regular languages using RFSAs. ⋮ Inference of \(\omega\)-languages from prefixes. ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Polynomial Identification of $$\omega $$-Automata ⋮ Efficient Learning of Tier-Based Strictly k-Local Languages ⋮ PAC Learning under Helpful Distributions ⋮ The efficiency of identifying timed automata and the power of clocks ⋮ One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit ⋮ Learning efficiency of very simple grammars from positive data ⋮ Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data ⋮ Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference ⋮ Learning algorithms ⋮ On the hardness of learning queries from tree structured data
This page was built for publication: Characteristic sets for polynomial grammatical inference
