Tree-Manipulating Systems and Church-Rosser Theorems
Journal of the ACM (JACM)
On some families of languages related to the Dyck language
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
Journal of Symbolic Computation
A catalogue of complete group presentations
Journal of Symbolic Computation
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Thue systems as rewriting systems
Journal of Symbolic Computation
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
The word problem for free partially commutative groups
Journal of Symbolic Computation
Cancellativity in finitely presented semigroups
Journal of Symbolic Computation
When is an extension of a specification consistent? Decidable and undecidable cases
Journal of Symbolic Computation
The regular problem and green equivalences for special monoids
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Bounded degree graph inference from walks
Journal of Computer and System Sciences
Complexity Results for Confluence Problems
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Word Problems for 2-Homogeneous Monoids and Symmetric Logspace
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A Normal Form for Church-Rosser Language Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Using complexity functions to generate normal forms for free algebra terms
CSC '84 Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium
The context-splittable normal form for Church--Rosser language systems
Information and Computation - RTA 2001
Information and Computation
Inverse monoids: Decidability and complexity of algebraic questions
Information and Computation
Information and Computation
Security analysis of word problem-based cryptosystems
Designs, Codes and Cryptography
LR parsing for global index languages (GILs)
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
GIGs: restricted context-sensitive descriptive power in bounded polynomial-time
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
On the wagner–magyarik cryptosystem
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Completion attacks and weak keys of oleshchuk’s public key cryptosystem
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Attacks on public key cryptosystems based on free partially commutative monoids and groups
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Pushouts in software architecture design
Proceedings of the 11th International Conference on Generative Programming and Component Engineering
| Hi-index | 0.01 |