Explicit representation of terms defined by counter examples
Journal of Automated Reasoning
Thue systems as rewriting systems
Journal of Symbolic Computation
Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
Automatic proofs by induction in theories without constructors
Information and Computation
Sufficient-completeness, ground-reducibility and their complexity
Acta Informatica
Bottom-up tree pushdown automata and rewrite systems
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
On relationship between term rewriting systems and regular tree languages
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Decision problems for term rewriting systems and recognizable tree languages
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Handbook of theoretical computer science (vol. B)
A new method for undecidability proofs of first order theories
Journal of Symbolic Computation
On proving inductive properties of abstract data types
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pumping, Cleaning and Symbolic Constraints Solving
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Proofs and Reachablity Problem for Ground Rewrite Systems
Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
Equality and Disequality Constraints on Direct Subterms in Tree Automata
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Complement Problems and Tree Automata in AC-like Theories (Extended Abstract)
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
The Reachability Problem for Ground TRS and Some Extensions
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Encompassment Properties and Automata with Constraints
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
A New Quasi-Reducibility Testing Algorithm and its Application to Proofs by Induction
Proceedings of the International Workshop on Algebraic and Logic Programming
About Connections Between Syntactical and Computational Complexity
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Decidability of Regularity and Related Properties of Ground Normal Form Languages
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Equational Formulas in Order-Sorted Algebras
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Regular Sets of Descendants for Constructor-Based Rewrite Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Reachability Analysis of Term Rewriting Systems with Timbuk
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Test Sets for the Universal and Existential Closure of Regular Tree Languages
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Extrapolating Tree Transformations
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Term rewriting restricted to ground terms
Theoretical Computer Science
Reachability Analysis over Term Rewriting Systems
Journal of Automated Reasoning
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Information Processing Letters
A theoretical limit for safety verification techniques with regular fix-point computations
Information Processing Letters
Information Processing Letters
On the Normalization and Unique Normalization Properties of Term Rewrite Systems
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Finer Is Better: Abstraction Refinement for Rewriting Approximations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Closure of Hedge-Automata Languages by Hedge Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Handling Left-Quadratic Rules When Completing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Closure of Tree Automata Languages under Innermost Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
TAGED Approximations for Temporal Properties Model-Checking
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
How to Tackle Integer Weighted Automata Positivity
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Approximation-based tree regular model-checking
Nordic Journal of Computing
Equational approximations for tree automata completion
Journal of Symbolic Computation
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Rewriting approximations for fast prototyping of static analyzers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Characterizing conclusive approximations by logical formulae
RP'11 Proceedings of the 5th international conference on Reachability problems
Rewriting approximations for properties verification over CCS specifications
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Equational abstraction refinement for certified tree regular model checking
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We present a collection of results on regular tree languages and rewrite systems. Moreover we prove the undecidability of the preservation of regularity by rewrite systems. More precisely we prove that it is undecidable whether or not for a set E of equations the set E(R) congruence closure of set R is a regular tree language whenever R is a regular tree language. It is equally undecidable whether or not for a confluent and terminating rewrite system S the set S(R) of ground S-normal forms of set R is a regular tree language whenever R is a regular tree language. Finally we study fragments of the theory of ground term algebras modulo congruence generated by a set of equations which can be compiled in a terminating, confluent rewrite system which preserves regularity.