Journal of Computer and System Sciences
Membership for growing context-sensitive grammars is polynomial
Journal of Computer and System Sciences
The problems of cyclic equality and conjugacy for finite complete rewriting systems
Theoretical Computer Science
On deciding the confluence of a finite string-rewriting system on a given congruence class
Journal of Computer and System Sciences
The Church-Rosser property for ground term-rewriting systems is decidable
Theoretical Computer Science
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
A closure property of regular languages (Note)
Theoretical Computer Science
Cancellativity in finitely presented semigroups
Journal of Symbolic Computation
A method for enumerating cosets of a group presented by a canonical system
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Information and Computation
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)
String-rewriting systems
NV-sequentiality: a decidable condition for call-by-need computations in term-rewriting systems
SIAM Journal on Computing
A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
Journal of Symbolic Computation
On weakly confluent monadic string-rewriting systems
STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Bottom-up tree pushdown automata: classification and connection with rewrite systems
Theoretical Computer Science
Linearizing term rewriting systems using test sets
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
Decidability of regularity and related properties of ground normal form languages
Information and Computation
Automata for reduction properties solving
Journal of Symbolic Computation
Handbook of formal languages, vol. 3
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Theoretical Computer Science
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Some undecidability results concerning the property of preserving regularity
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
Journal of Symbolic Computation
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
An algorithm for reasoning about equality
Communications of the ACM
Word Processing in Groups
On Restarting Automata with Rewriting
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Automatic Monoids Versus Monoids with Finite Convergent Presentations
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
RTA '89 Proceedings of the 3rd 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
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems
RTA '97 Proceedings of the 8th 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
Decidability of confluence for ground term rewriting systems
FCT '85 Fundamentals of Computation Theory
The Power of the Church-Rosser Property for String Rewriting Systems
Proceedings of the 6th Conference on Automated Deduction
Sequentiality, Second-order Monadic Logic and Tree Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
Formal language theory, and in particular the theory of automata, has provided many tools that have been found extremely useful in rewriting theory, since automata can be used for deciding certain properties of rewriting systems as well as for constructing (weakly) confluent rewriting systems. On the other hand, rewriting theory has had some influence on the development of formal language theory, since based on certain rewriting systems some interesting classes of formal languages have been defined. Here a survey on some connections between rewriting and formal language theory is given, starting from the classical string languages and string-rewriting systems and continuing with tree automata and term-rewriting systems.