Linearizing term rewriting systems using test sets
From MaRDI portal
Publication:1332338
DOI10.1006/jsco.1994.1005zbMath0821.68071OpenAlexW2035209295MaRDI QIDQ1332338
Publication date: 12 September 1994
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1994.1005
Related Items
Towards an efficient construction of test sets for deciding ground reducibility, Test sets for the universal and existential closure of regular tree languages., Using induction and rewriting to verify and complete parameterized specifications, Recognizable tree-languages and nonlinear morphisms