Grammatical inference: An old and new paradigm
From MaRDI portal
Publication:6061882
DOI10.1007/3-540-60454-5_25zbMath1527.68114OpenAlexW1548551619MaRDI QIDQ6061882
Publication date: 8 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60454-5_25
Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On learning from queries and counterexamples in the presence of noise
- Learning context-free grammars from structural data in polynomial time
- Learning regular sets from queries and counterexamples
- Grammatical inference for even linear languages based on control sets
- Finding patterns common to a set of strings
- Efficient learning of context-free grammars from positive structural examples
- On the structural grammatical inference problem for some classes of context-free grammars
- On the computational complexity of approximating distributions by probabilistic automata
- Synthesis of real time acceptors
- Grammatical inference and applications. 2nd international colloquium, ICGI-94, Alicante, Spain, September 21-23, 1994. Proceedings
- When won't membership queries help?
- Learning fallible deterministic finite automata
- On polynomial-time learnability in the limit of strictly deterministic automata
- Queries and concept learning
- A theory of the learnable
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- The minimum consistent DFA problem cannot be approximated within any polynomial
- Complexity of automaton identification from given data
- Skeletal structural descriptions
- A note on the number of queries needed to identify regular languages
- Language identification in the limit
This page was built for publication: Grammatical inference: An old and new paradigm
