Deterministic finite automata (DFAs) are constructed for various purposes in computational biology. Little attention, however, has been given to the efficient construction of minimal DFAs. In this article, we define simple nondeterministic finite automata (NFAs) and prove that the standard subset construction transforms NFAs of this type into minimal DFAs. Furthermore, we show how simple NFAs c...

We study the computational complexity of partitioning the vertices of a graph into generalized dominating sets. Generalized dominating sets are param-eterized by two sets of nonnegative integers and which constrain the neighborhood N (v) of vertices. A set S of vertices of a graph is said to be a (;)-set if 8v 2 S : jN(v)\Sj 2 and 8v 6 2 S : jN(v)\Sj 2 .

We propose a metaheuristic algorithm for the multi-resource generalizedassignment problem (MRGAP). MRGAP is a generalization of the generalized assignmentproblem, which is one of the representative combinatorial optimization problems knownto be NP-hard. The algorithm features a very large-scale neighborhood search, which is amechanism of conducting the search with complex and po...

We consider a single-machine scheduling problem which arises as a subproblem in a job-shop environment where the jobs have to be transported between the machines by a single transport robot. The robot scheduling problem may be regarded as a generalization of the traveling salesman problem with time windows, where additionally generalized precedence constraints have to be respected. The objectiv...

We consider the generalized minimum edge-biconnected network problem where the nodes of a graph are partitioned into clusters and exactly one node from each cluster is required to be connected in an edge-biconnected way. Instances of this problem appear, for example, in the design of survivable backbone networks. We present different variants of a variable neighborhood search approach that util...

Information tables provide a convenient and useful tool for representing a set of objects using a group of attributes. This notion is enriched by introducing neighborhood systems on attribute values. The neighborhood systems represent the semantics relationships between, and knowledge about, attribute values. With added semantics, neighborhood based information tables may provide a more general...

This work presents an application of the previously proposed Support Vector Machines Based Generalized Predictive Control (SVM-Based GPC) method [1] to the problem of controlling chaotic dynamics with small parameter perturbations. The Generalized Predictive Control (GPC) method, which is included in the class of Model Predictive Control, necessitates an accurate model of the plant that plays v...

We study the isolated periodic wave trains in a class of modified generalized Burgers–Huxley equation. The planar systems with degenerate equilibrium arising after traveling transformation are investigated. By finding certain positive definite Lyapunov functions neighborhood singular points and Hopf bifurcation points, number possible limit cycles corresponding is determined. existence equation...