Test sets for the universal and existential closure of regular tree languages.

DOI10.1006/inco.2002.3156zbMath1049.68077OpenAlexW4241042196MaRDI QIDQ1400712

Dieter Hofbauer, Maria Huber

Publication date: 2002

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cb04ff6e0490d9070235bc30ea6af85feae59f90

zbMATH Keywords

term rewritingground reducibility

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Uses Software

• EXPANDER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing for the ground (co-)reducibility property in term-rewriting systems
• Automating inductionless induction using test sets
• Proofs by induction in equational theories with constructors
• On sufficient-completeness and related properties of term rewriting systems
• Un théorème de duplication pour les forets algébriques
• Linearizing term rewriting systems using test sets
• Automated theorem proving by test set induction
• Automatic proofs by induction in theories without constructors
• Ground reducibility is EXPTIME-complete
• Decidability of regularity and related properties of ground normal form languages
• Automata for reduction properties solving
• Sufficient-completeness, ground-reducibility and their complexity
• Semantic confluence tests and completion methods
• Deduction and Declarative Programming
• Automated Mathematical Induction
• Tree generating regular systems

This page was built for publication: Test sets for the universal and existential closure of regular tree languages.