Abstract. An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in o...
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that ...
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...