Term rewriting restricted to ground terms

Authors:
Sándor Vágvögyi
Affiliations:
Department of Applied Informatics, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary
Venue:
Theoretical Computer Science
Year:
2003

Citing 22
Cited 3

The Church-Rosser property for ground term-rewriting systems is decidable

Theoretical Computer Science
Deterministic tree pushdown automata and monadic tree rewriting systems

Journal of Computer and System Sciences
A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata

Fundamenta Informaticae
Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems

Information and Computation
String-rewriting systems

String-rewriting systems
An algorithm for finding canonical sets of ground rewrite rules in polynomial time

Journal of the ACM (JACM)
A fast algorithm for generating reduced ground rewriting systems from a set of ground equations

Journal of Symbolic Computation
A fast algorithm for constructing a tree automaton recognizing a congruential tree language

Theoretical Computer Science
Bottom-up tree pushdown automata: classification and connection with rewrite systems

Theoretical Computer Science
Proof lengths for equational completion

Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
Linear generalized semi-monadic rewrite systems effectively preserve recognizability

Theoretical Computer Science
Term rewriting and all that

Term rewriting and all that
Some undecidability results concerning the property of preserving regularity

Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
The ground tree transducer game

Fundamenta Informaticae
Simple and minimal ground term equation systems

Fundamenta Informaticae
Congruential complements of ground term rewrite systems

Theoretical Computer Science
A property of left-linear rewrite systems preserving recognizability

Theoretical Computer Science
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Shostak's Congruence Closure as Completion

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
On One-Pass Term Rewriting

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Complexity of finitely presented algebras

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Regular Tree Languages And Rewrite Systems

Fundamenta Informaticae

Deterministic bottom-up tree transducers and ground term rewrite systems

Theoretical Computer Science
Congruences Generated by Extended Ground Term Rewrite Systems

Fundamenta Informaticae
Congruences Generated by Extended Ground Term Rewrite Systems

Fundamenta Informaticae

Quantified Score

Hi-index	5.23

Visualization

Abstract

Episturmian morphisms generalize Sturmian morphisms. Here, we study some intrinsic properties of these morphisms: invertibility, presentation, cancellativity, unitarity, characterization by conjugacy. Most of them are generalizations of known properties ...