Sciweavers

FCT
1999
Springer
14 years 4 months ago
A General Categorical Connection between Local Event Structures and Local Traces
Local event structures and local traces are generalizations of the classical prime event structures and Mazurkiewicz’ traces in which independence is no longer a global binary pr...
H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy
FCT
1999
Springer
14 years 4 months ago
On Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
Manfred Droste, Dietrich Kuske
FCT
1999
Springer
14 years 4 months ago
Generalized P-Systems
Rudolf Freund
FCT
1999
Springer
14 years 4 months ago
Tile Transition Systems as Structured Coalgebras
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
Andrea Corradini, Reiko Heckel, Ugo Montanari
FCT
1999
Springer
14 years 4 months ago
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
Cristina Bazgan, Wenceslas Fernandez de la Vega
FCT
1999
Springer
14 years 4 months ago
Iterative Arrays with a Wee Bit Alternation
Abstract. An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fe...
Thomas Buchholz, Andreas Klein, Martin Kutrib
FCT
1999
Springer
14 years 4 months ago
Restrictive Acceptance Suffices for Equivalence Problems
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
Bernd Borchert, Lane A. Hemaspaandra, Jörg Ro...