Binary (generalized) post correspondence problem
Theoretical Computer Science
An Undecidability Result Concerning Periodic Morphisms
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Post Correspondence Problem for short words
Information Processing Letters
Decidability and undecidability of marked PCP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Post correspondence problem with partially commutative alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |