Showing papers in "Theoretical Computer Science in 1997"

TL;DR: A space filling curve (SFC) is a numbering of the cells of this grid with numbers from c+1 to c+N2, for some c≥0, if it can be recursively divided into four square RSFCs of equal size.

TL;DR: It is shown that, by this result, one can construct in a simple way all finite and infinite standard Sturmian words.

TL;DR: A new linear time algorithm for constructing rectangular dual of planar graphs by using regular edge labeling and reduces the size of the representation by a factor of 2 for 4-connected triangulated plane graphs.

TL;DR: This work presents a query answering procedure that takes a query Q and a set of evidence E and constructs a Bayesian network to compute P(Q¦E) .

TL;DR: It is shown that probabilistic behavior maps, which are an abstract representation of I/O automaton behavior in terms of a certain expectation operator, are compositional and fully abstract with respect to a natural notion of Probabilistic testing.

TL;DR: It is shown that logic programming semantics can be more meaningful for abductive reasoning than classical inference by providing examples from the area of knowledge representation and reasoning, and proves abduction from logic programs as a rich source of problems of varying complexity.

TL;DR: Some new combinatorial properties of the set PER of all words w having two periods p and q which are coprimes are proved and it is shown that aPERb ∪{ a , b } = St ∩ Lynd , where St is the set of the finite factors of all infinite Sturmian words and Lynd is theSet of the Lyndon words on the alphabet { a, b }.

TL;DR: This paper introduces a class of fugitive-search games where the searchers do not see the fugitive and the fugitive can only move just before a searcher is placed on the vertex it occupies, and gives an equivalent characterization of the search number for any given fugitive speed in terms of an elimination ordering of the vertices of the graph.

TL;DR: D deterministic and randomized self-stabilizing algorithms that maintain a rooted spanning tree in a general network whose topology changes dynamically, which provide for the easy construction of self-Stabilizing protocols for numerous tasks.

TL;DR: This paper examines string block edit distance, in which two strings A and B are compared by extracting collections of substrings and placing them into correspondence, and shows that several variants are NPcomplete and give polynomial-time algorithms for solving the remainder.

TL;DR: It is shown here that in contrast to an earlier study, the synthesis problem is indeed NP-complete for the class of elementary nets.

TL;DR: The theory of transfinite reduction for orthogonal term rewriting systems for the lambda calculus is established and the Bohm model of thelambda calculus can be seen as an infinitary term model.

TL;DR: A new approach to automatic derivation of formulas needed in nonlinear finite element analysis is presented, combining several techniques: symbolic capabilities of Mathematica, automatic differentiation technique, simultaneous optimization of expressions and a stochastic evaluation of the formulas instead of a conventional pattern matching technique.

TL;DR: A logic for rough sets is presented and its algebraic semantics is presented in the spirit of Andreka and Nemeti (1994).

TL;DR: A new algorithm is presented that makes extensive use of monotonicity considerations to solve the problem of evaluating expressions in a fixpoint calculus over a given model in about nd/2 steps.

TL;DR: This thesis exploits a method of program improvement in which costly repeated calculations can be avoided by establishing and maintaining program invariants by exploiting the method of symbolic finite differencing.

TL;DR: This paper implies the first known exponential lower bounds on the number of nodes of threshold-MOD r circuits, based on a new method for estimating the minimum length of threshold realizations over predefined function bases, which, in contrast to previous related techniques, works even if the weight of the realization is allowed to be unbounded, and if the bases are allowed to been nonorthogonal.

TL;DR: This is an overview of the formal definition of the EML language, an informal explanation of the main ideas, gives the rationale for certain design decisions, and outlines some of the technical issues involved.

TL;DR: These algorithms yields polynomial time algorithms for the four NP-complete graph problems on any subclass of the asteroidal triple-free graphs that has a polynomially bounded number of minimal separators, as e.g. cocomparability graphs of bounded dimension and d-trapezoid graphs for any fixed d ⩾ 1.

TL;DR: A lattice of eight languages is proposed, where its bottom element L is a process algebra differing from CCS only for the asynchrony of the output operation, while all the other languages in the lattice are obtained as extension of this basic language by adding some of the Linda coordination primitives.

TL;DR: It is shown how to modify characterizations of sets of numbers recognizable by a finite automaton, when integer bases p are replaced by linear numeration systems whose characteristic polynomial is the minimalPolynomial of a Pisot number.

TL;DR: A reduced reachability graph called symbolic reachabilitygraph is presented that can be constructed directly by an efficient algorithm without considering the actual state space of the model and its analysis provides equivalent results as the analysis of the ordinary reachable graph.

TL;DR: It is shown that the length of the shortest reset word for a solvable automaton with n states is at most n − 1 and this bound is reachable.

TL;DR: It is shown that the category of symmetrically compact -continuity spaces with continuous maps has many of the key properties required of a category of domains and that it captures, in a natural way, the traditional examples.

TL;DR: This paper provides a characterization of all the squares in F, hence in every prefix Fn; this characterization naturally gives rise to a algorithm which specifiesall the squares of Fn in an appropriate encoding.

TL;DR: In this paper, the authors consider processes that have transitions labeled with atomic actions and states labeled with formulas over a propositional logic, called signals, and show that a process in a parallel composition may proceed conditionally, dependent on the presence of a signal in the process in parallel.

TL;DR: This paper generalizes this idea to the case where entire components — for example, the proof theory — of one of the logics involved may be completely missing, so that the appropriate mapping could not even be defined.

TL;DR: A sound and complete method is described for evaluating queries in probabilistic theories and can be incorporated into existing relational systems with the addition of a component for manipulating propositional formulas.

TL;DR: The theoretical issues raised by the introduction of flexible queries are studied in the case of the division operator, in the framework of fuzzy sets and possibility theory.

TL;DR: It is shown that every nc-random set in E has nk-random predecessors in E for any k ≥ 1, whereas the amount of randomness of the successors is bounded, and that there are weakly complete problems which are not p-btt-complete for E.