We show that the marked version of the Post Correspondence Problem, where the words on a list are required to di er in the rst letter, is decidable. On the other hand, PCP remains ...
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The...
Samuel R. Buss, Christos H. Papadimitriou, John N....
Abstract. We introduce an implication-with-possible-exceptions and define validity of rules-withpossible-exceptions by means of the topological notion of a full subset. Our implica...
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
Abstract. Location estimation and user behavior recognition are research issues that go hand in hand. In the past, these two issues have been investigated separately. In this paper...