Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A Weaker Precondition for Loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
Elements of the Theory of Computation
Elements of the Theory of Computation
A Discipline of Programming
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Topological Characterizations of Infinite Behaviours of Transition Systems
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Transformations Realizing Fairness Assumptions for Parallel Programs
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Specification and verification of concurrent programs by A∀automata
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Hamiltonian paths in infinite graphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Progress measures and stack assertions for fair termination
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Decidability of Quantifed Propositional Branching Time Logics
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Reasoning in expressive description logics
Handbook of automated reasoning
The description logic handbook
Decidability and undecidability in stand-alone feature logics
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
On the (High) Undecidability of Distributed Synthesis Problems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Recognizable tree series with discounting
Acta Cybernetica
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
Proving symmetries by model transformation
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Undecidability results for bisimilarity on prefix rewrite systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Well-structured program equivalence is highly undecidable
ACM Transactions on Computational Logic (TOCL)
Standing on the shoulders of a giant: one persons experience of turings impact
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
An update on query answering with restricted forms of negation
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
| Hi-index | 0.00 |
Elementary translations between various kinds of recursive trees are presented. It is shown that trees of either finite or countably infinite branching can be effectively put into one-one correspondence with infinitely branching trees in such a way that the infinite paths of the latter correspond to the “P-abiding” infinite paths of the former. Here P can be any member of a very wide class of properties of infinite paths. For many properties ??, the converse holds too. Two of the applications involve (a) the formulation of large classes of highly undecidable variants of classical computational problems, and in particular, easily describable domino problems that are III11-complete, and (b) the existence of a general method for proving termination of nondeterministic or concurrent programs under any reasonable notion of fairness.