Some classes of term rewriting systems inferable from positive data

DOI10.1016/j.tcs.2008.02.027zbMath1145.68029OpenAlexW2029467631MaRDI QIDQ924174

M. R. K. Krishna Rao

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.027

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Inductive inference of monotonic formal systems from positive data
• Counterexamples to termination for the direct sum of term rewriting systems
• Some classes of Prolog programs inferable from positive data
• Termination of term rewriting using dependency pairs
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• Algorithmic Learning Theory
• Language identification in the limit
• Inductive inference of unbounded unions of pattern languages from positive data

This page was built for publication: Some classes of term rewriting systems inferable from positive data