Some classes of term rewriting systems inferable from positive data
From MaRDI portal
Publication:924174
DOI10.1016/j.tcs.2008.02.027zbMath1145.68029MaRDI QIDQ924174
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
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