Generalized Post Embedding Problems
Logic in Computer Science
2016-07-07 v4 Formal Languages and Automata Theory
Abstract
The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to undecidability.
Cite
@article{arxiv.1109.1691,
title = {Generalized Post Embedding Problems},
author = {Prateek Karandikar and Philippe Schnoebelen},
journal= {arXiv preprint arXiv:1109.1691},
year = {2016}
}