Inferring subclasses of contextual languages

DOI10.1007/978-3-540-45257-7_6MaRDI QIDQ2754002zbMATH OpenFDO

Authors J. D. Emerald, K. G. Subramanian, Durairaj Gnanaraj Thomas

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-uniformidentification in the limit from positive datainternal contextual grammarsstrict

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Polynomial time algorithm for inferring subclasses of parallel internal column contextual array languages
• Polynomial time learner for inferring subclasses of internal contextual grammars with local maximum selectors
• Inferring pure context-free languages from positive data
• Inferring regular languages by merging nonterminals
• On Internal Contextual Grammars with Subregular Selection Languages

Cited in

(5)

• A note on inferring uniquely terminating code languages
• Polynomial time learner for inferring subclasses of internal contextual grammars with local maximum selectors
• Learning Context-Sensitive Languages from Linear Structural Information
• Contextual multilanguages: A learning method
• Polynomial time algorithm for inferring subclasses of parallel internal column contextual array languages

This page was built for publication: Inferring subclasses of contextual languages

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