Inferability of context-free programmed grammars
From MaRDI portal
Recommendations
Cites work
- A general approach to inference of context-free programmed grammars
- A solution of the syntactical induction-inference problem for regular languages
- scientific article; zbMATH DE number 3825216 (Why is no real title available?)
- scientific article; zbMATH DE number 3596271 (Why is no real title available?)
- scientific article; zbMATH DE number 3403744 (Why is no real title available?)
- Inference of a class of CFPG by means of semantic rules
- Optimization of LR(k) parsers
- Programmed Grammars and Classes of Formal Languages
- Syntactic/semantic techniques in pattern recognition: A survey
Cited in
(7)- Modeling rule-based systems by stochastic programmed production systems
- Remarks on the structural grammatical inference problem for context-free grammars
- Specification inference using context-free language reachability
- A general approach to inference of context-free programmed grammars
- Flowchart recognition—a syntactic approach
- scientific article; zbMATH DE number 4209618 (Why is no real title available?)
- scientific article; zbMATH DE number 6606360 (Why is no real title available?)
This page was built for publication: Inferability of context-free programmed grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217619)