
arXiv: 1109.1691
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.
computability, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), subwords and Higman's lemma, Computer Science - Formal Languages and Automata Theory, Automata and formal grammars in connection with logical questions, channel systems, Logic in Computer Science (cs.LO), Post's embedding problem, Decidability of theories and sets of sentences, well-quasi-ordering, Post's correspondence problem
computability, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), subwords and Higman's lemma, Computer Science - Formal Languages and Automata Theory, Automata and formal grammars in connection with logical questions, channel systems, Logic in Computer Science (cs.LO), Post's embedding problem, Decidability of theories and sets of sentences, well-quasi-ordering, Post's correspondence problem
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
