Add to ORKGWe consider the parallel complexity of some problems issued from Petri nets, partially commutative monoids and finite automata. we prove the following: (19 The membership problem for firing sequances on Petri Nets can be solved in constant time by circuits of unbounded fan-in with gatesPostprint (published version
AbstractWe study two classes of unbounded fan-in parallel computation, the standard one, based on un...
AbstractWe consider the test pattern generation problem for circuits, which compute expressions over...
AbstractThe membership problem in transformation monoids is the natural extension to the well-studie...
We consider the parallel complexity of some problems issued from Petri nets, partially commutative m...
We consider the parallel complexity of some problems issued from Petri nets, partially commutative m...
We study the parallel complexity of three problems on concurrency: decision of firing sequences for ...
We study the parallel complexity of three problems on concurrency: decision of firing sequences for ...
AbstractThe free partially commutative monoid M(A,Θ) defined by a set of commutation relations Θ on ...
AbstractLinear-time algorithms are presented for several problems concerning words in a partially co...
We determine the parallel complexity of several (uniform) membership problems for recognizable tree...
Given a finite set X of states, a finite set of transformations of X (generators), and another trans...
In this thesis, we address a number of issues pertaining to the computational power of monoids and ...
We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) wit...
We improve several upper bounds to the complexity of the membership problem for languages defined by...
AbstractTrace languages have been introduced in order to describe the behaviour of concurrent system...
AbstractWe study two classes of unbounded fan-in parallel computation, the standard one, based on un...
AbstractWe consider the test pattern generation problem for circuits, which compute expressions over...
AbstractThe membership problem in transformation monoids is the natural extension to the well-studie...
We consider the parallel complexity of some problems issued from Petri nets, partially commutative m...
We consider the parallel complexity of some problems issued from Petri nets, partially commutative m...
We study the parallel complexity of three problems on concurrency: decision of firing sequences for ...
We study the parallel complexity of three problems on concurrency: decision of firing sequences for ...
AbstractThe free partially commutative monoid M(A,Θ) defined by a set of commutation relations Θ on ...
AbstractLinear-time algorithms are presented for several problems concerning words in a partially co...
We determine the parallel complexity of several (uniform) membership problems for recognizable tree...
Given a finite set X of states, a finite set of transformations of X (generators), and another trans...
In this thesis, we address a number of issues pertaining to the computational power of monoids and ...
We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) wit...
We improve several upper bounds to the complexity of the membership problem for languages defined by...
AbstractTrace languages have been introduced in order to describe the behaviour of concurrent system...
AbstractWe study two classes of unbounded fan-in parallel computation, the standard one, based on un...
AbstractWe consider the test pattern generation problem for circuits, which compute expressions over...
AbstractThe membership problem in transformation monoids is the natural extension to the well-studie...