Sciweavers

IANDC
1998
70views more  IANDC 1998»
13 years 11 months ago
The Generating Power of Total Deterministic Tree Transducers
ed tree transducers are abstract models used to study properties bute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that...
Sebastian Maneth
IANDC
1998
64views more  IANDC 1998»
13 years 11 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
IANDC
1998
106views more  IANDC 1998»
13 years 11 months ago
A Conservative Look at Operational Semantics with Variable Binding
We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechan...
Wan Fokkink, Chris Verhoef
IANDC
1998
64views more  IANDC 1998»
13 years 11 months ago
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
IANDC
1998
70views more  IANDC 1998»
13 years 11 months ago
Diagram Techniques for Confluence
op diagram techniques for proving confluence in abstract reductions systems. The underlying theory gives a systematic and uniform framework in which a number of known results, wide...
Marc Bezem, Jan Willem Klop, Vincent van Oostrom
IANDC
1998
72views more  IANDC 1998»
13 years 11 months ago
On the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...
Maria Paola Bonacina, Jieh Hsiang
IANDC
1998
50views more  IANDC 1998»
13 years 11 months ago
Optimal Parallel Two Dimensional Text Searching on a CREW PRAM
Amihood Amir, Gary Benson, Martin Farach