FCT
1999
Springer
14 years 7 months ago
1999
Springer
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...
FCT
1999
Springer
14 years 7 months ago
1999
Springer
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...
FCT
1999
Springer
14 years 7 months ago
1999
Springer
FCT
1999
Springer
14 years 7 months ago
1999
Springer
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...
FCT
1999
Springer
14 years 7 months ago
1999
Springer
Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
FCT
1999
Springer
14 years 7 months ago
1999
Springer
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...
FCT
1999
Springer
14 years 7 months ago
1999
Springer
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 ...