13306 search results - page 433 / 2662 » Theoretical Computer Science |
145
click to vote
MFCS
2000
Springer
15 years 11 months ago
2000
Springer
In this paper we investigate the periodic structure of rich words (i.e., words having the highest possible number of palindromic factors), giving new results relating them with per...
171
click to vote
MFCS
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
190
Voted
RELMICS
2000
Springer
15 years 11 months ago
2000
Springer
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...
191
Voted
RTA
2000
Springer
15 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 ...
160
Voted
SPIN
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We give a detailed description of SymmSpin, a symmetryreduction package for Spin. It o ers four strategies for state-space reduction, based on the heuristic that we prese...