Test sets for the universal and existential closure of regular tree languages.
type: Item
instance of: scholarly article
title: Test sets for the universal and existential closure of regular tree languages.
zbMATH Open document ID: 1049.68077
author: Dieter Hofbauer
author: Maria Huber
published in: Information and Computation
publication date: 2002-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1964175
zbMATH Keywords: term rewriting
zbMATH Keywords: ground reducibility
describes a project that uses: EXPANDER
MaRDI profile type: Publication
OpenAlex ID: W4241042196
cites work: Un théorème de duplication pour les forets algébriques
cites work: Q4039803
cites work: Automated theorem proving by test set induction
cites work: Automated Mathematical Induction
cites work: Tree generating regular systems
cites work: Ground reducibility is EXPTIME-complete
cites work: Automata for reduction properties solving
cites work: Q5633929
cites work: Q4079524
cites work: Q4198056
cites work: Q3323279
cites work: Q4847003
cites work: Q4200260
cites work: Linearizing term rewriting systems using test sets
cites work: Q4938607
cites work: Q4954448
cites work: Proofs by induction in equational theories with constructors
cites work: Automatic proofs by induction in theories without constructors
cites work: Sufficient-completeness, ground-reducibility and their complexity
cites work: Q3783519
cites work: On sufficient-completeness and related properties of term rewriting systems
cites work: Automating inductionless induction using test sets
cites work: Testing for the ground (co-)reducibility property in term-rewriting systems
cites work: Q4712663
cites work: Decidability of regularity and related properties of ground normal form languages
cites work: Q3853827
cites work: Deduction and Declarative Programming
cites work: Semantic confluence tests and completion methods
cites work: Q3142025
cites work: Q3221429
cites work: Q4431392
DOI: 10.1006/INCO.2002.3156
Recommended article: Q4938607
Recommended article: The congruence theory of closure properties of regular tree languages
Recommended article: Algebras for classifying regular tree languages and an application to frontier testability
Recommended article: Automata, Languages and Programming
Recommended article: Property testing of regular tree languages
Recommended article: On Topological Completeness of Regular Tree Languages
Recommended article: Efficient constructions of test sets for regular and context-free languages
Recommended article: Q4035247
Recommended article: Q4381396
description: scientific article; zbMATH DE number 1964175