Some classes of term rewriting systems inferable from positive data
type: Item
instance of: scholarly article
title: Some classes of term rewriting systems inferable from positive data
zbMATH Open document ID: 1145.68029
author: M. R. K. Krishna Rao
published in: Theoretical Computer Science
publication date: 2008-05-28T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 5279852
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.02.027
OpenAlex ID: W2029467631
cites work: Inductive inference of formal languages from positive data
cites work: Q4942639
cites work: Termination of term rewriting using dependency pairs
cites work: Toward a mathematical theory of inductive inference
cites work: Q4385532
cites work: Language identification in the limit
cites work: Some classes of Prolog programs inferable from positive data
cites work: Algorithmic Learning Theory
cites work: Inductive inference of monotonic formal systems from positive data
cites work: Inductive inference of unbounded unions of pattern languages from positive data
cites work: Counterexamples to termination for the direct sum of term rewriting systems
DOI: 10.1016/J.TCS.2008.02.027
description: scientific article; zbMATH DE number 5279852