Learning Context-Sensitive Languages from Linear Structural Information

DOI10.1007/978-3-540-88009-7_14MaRDI QIDQ3528417zbMATH OpenOpenAlexFDO

Authors Jose M. Sempere

Publication date 16 October 2008

Published in Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88009-7_14

zbMATH Keywords

\(k\)-testable languagescontext-sensitive languagesidentifiability from positive structural datalinear languagesWatson-Crick finite automata

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Remarks on the structural grammatical inference problem for context-free grammars
• scientific article; zbMATH DE number 1670713
• Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time
• Inferring pure context-free languages from positive data
• Using contextual representations to efficiently learn context-free languages

Cited in

(5)

• Grammatical inference of directed acyclic graph languages with polynomial time complexity
• Algorithms for inferring context-sensitive L-systems
• Using contextual representations to efficiently learn context-free languages
• Languages as hyperplanes: grammatical inference with string kernels
• scientific article; zbMATH DE number 6819790 (Why is no real title available?)

This page was built for publication: Learning Context-Sensitive Languages from Linear Structural Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528417)