Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Public quadratic polynomial-tuples for efficient signature-verification and message-encryption
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Algorithm 628: An algorithm for constructing canonical bases of polynomial ideals
ACM Transactions on Mathematical Software (TOMS)
Equivalence checking of datapaths based on canonical arithmetic expressions
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
The Complexity of the Finite Containment Problem for Petri Nets
Journal of the ACM (JACM)
Off-line and on-line algorithms for deducing equalities
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Structural Characterization and Qualitative Properties of Product Form Stochastic Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
The decidability of the reachability problem for vector addition systems (Preliminary Version)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Computing communication cost by Petri nets for hardware/software codesign
RSP '97 Proceedings of the 8th International Workshop on Rapid System Prototyping (RSP '97) Shortening the Path from Specification to Prototype
Journal of Automated Reasoning
Product-form and stochastic Petri nets: a structural approach
Performance Evaluation
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Model checking coverability graphs of vector addition systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Proceedings of the 9th International Conference on Computational Methods in Systems Biology
Vector addition system reversible reachability problem
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Dynamic cutoff detection in parameterized concurrent programs
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Reachability In Some Classes Of Acyclic Petri Nets
Fundamenta Informaticae
Reachability In Some Classes Of Acyclic Petri Nets
Fundamenta Informaticae
Efficient coverability analysis by proof minimization
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Bounded context-switching and reentrant locking
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
The power of well-structured systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
| Hi-index | 0.00 |
The uniform word problem for commutative semigroups (UWCS) is the problem of determining from any given finite set of defining relations and any pair of words, whether the words describe the same element in the commutative semigroup defined by the relations. The effective decidability of this classical algebraic problem was first explicitly noted by Malcev [1958] and Emilichev [1958], though in retrospect this result can be seen to be contained in the earlier work of König [1903] and Hermann [1926] on polynomial ideals.