305 search results - page 21 / 61 » Decidability of Split Equivalence |
FCT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
TACS
2001
Springer
14 years 3 days ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
RTA
2000
Springer
13 years 11 months ago
2000
Springer
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
We consider nondeterministic and probabilistic termination problems in a process algebra that is equivalent to basic chemistry. We show that the existence of a terminating computat...
MCU
1998
13 years 9 months ago
1998
A BSS machine is -uniform if it does not use exact tests; such machines are equivalent (modulo parameters) to Type 2 Turing machines. We define a notion of closure related to Turi...