Within the last year
Within the past 3 years
1 - 7 of 7 articles
In this paper we propose a generalization of the Assignment Problem. First, we describe an algorithm, based on network flow techniques, that obtains just one solution of the approached problem; further, we develop an algorithm that is able to find all the solutions. Finally, we discuss how this...
We introduce tense LM _n -algebras and tense MV-algebras as algebraic structures for some tense many-valued logics. A representation theorem for tense LM _n -algebras is proved and the polynomial equivalence between tense LM _3 -algebras (resp. tense LM _4 -algebras) and tense MV _3 -algebras...
By explicit nondeterminism degree of a pushdown automata we mean the maximal number of choices in the transitions of the automata. In this paper we will prove that each pushdown automaton has an equivalent pushdown automaton with degree 1 of explicit nondeterminism, which implies that λ-moves in...
The starting definitions of araucarias given in (1) contain some mistakes. We give here new definitions which replace Definitions 2.2, 2.3 and 2.4, Theorem 2.1 and Corollary 2.1. The rest of the paper is based on the characterization of araucarias given in Theorem 1.1 and remains true with these...
A string x is an outfix of a string y if there is a string w such that x _1 wx _2 = y and x = x _1 x _2 . A set X of strings is outfix-free if no string in X is an outfix of any other string in X. Based on the properties of outfix strings, we develop a polynomial-time algorithm that determines...
We give a generic framework to analyze the average-case running time for computing the so called recurrent properties for pairs of binary search trees. Recurrent properties are algorithms that operate on pairs of trees testing some characteristic on nodes by performing a preorder traversal on...
In this paperwe explain how to derive learnability of some classes of categorial languages as a consequence of the a property that have unifiable infinite sets of types, namely unification compactness. At first we present an alternate (with respect to (6)) proof of learnability of rigid...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.