The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 21 –
40 of
180
We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are equipped with an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of word languages that are linearizations of context-free trace languages.
We study cooperating distributed systems (CD-systems) of stateless deterministic
restarting automata with window size 1 that are equipped with an external pushdown store.
In this way we obtain an automata-theoretical characterization for the class of word
languages that are linearizations of context-free trace languages.
This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination in this...
This paper offers characteristic formula constructions in the
real-time logic Lν for several behavioural relations between
(states of) timed automata. The behavioural relations studied in
this work are timed (bi)similarity, timed ready simulation,
faster-than bisimilarity and timed trace inclusion. The
characteristic formulae delivered by our constructions have size
which is linear in that of the timed automaton they logically
describe. This also applies to the characteristic formula for...
We investigate well-structured graph-driven parity-FBDDs, which strictly generalize the two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is a characterization of the complexity of Boolean functions represented by well-structured graph-driven parity-FBDDs in terms of invariants of the function represented and the graph-ordering used. As a consequence, we derive a lower bound criterion and prove an exponential lower bound for certain linear code functions....
We investigate well-structured graph-driven parity-FBDDs, which strictly generalize
the two well-known models parity OBDDs and well-structured graph-driven FBDDs.
The first main result is a characterization of the complexity of Boolean
functions represented by well-structured graph-driven parity-FBDDs in terms of
invariants of the function represented and the graph-ordering used.
As a consequence, we derive a lower bound criterion and prove an exponential
lower bound for certain linear code functions.
The...
It is proved that checking positive definiteness, stability or nonsingularity of all [symmetric] matrices contained in a symmetric interval matrix is NP-hard.
Circular splicing has been very recently introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we restrict our study to the relationship between regular circular languages and languages generated by finite circular splicing systems and provide some results towards a characterization of the intersection between these two classes. We consider the class of languages , called here star languages, which are closed...
Circular splicing has been very recently introduced
to model a specific recombinant behaviour
of circular DNA, continuing the investigation initiated
with linear splicing. In this paper we restrict our
study to the
relationship between regular circular languages
and languages generated by finite circular splicing systems
and provide some results towards a characterization
of the intersection between these two classes.
We consider the class of languages X*, called
here star languages, which are closed...
Currently displaying 21 –
40 of
180