Results 1 to 10 of about 3,683 (247)

Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata [PDF]

open access: yesTheory of Computing Systems, 2021
AbstractWe show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A max-plus tree automaton is a weighted tree automaton over the max-plus semiring. A max-plus tree automaton is called finitely ambiguous if the number of accepting runs on every tree is bounded by a global constant.
Erik Paul
exaly   +5 more sources

Finite Sequentiality of Unambiguous Max-Plus Tree Automata [PDF]

open access: yesTheory of Computing Systems, 2021
AbstractWe show the decidability of the finite sequentiality problem for unambiguous max-plus tree automata. A max-plus tree automaton is called unambiguous if there is at most one accepting run on every tree. The finite sequentiality problem asks whether for a given max-plus tree automaton, there exist finitely many deterministic max-plus tree ...
Erik Paul
exaly   +5 more sources

An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets [PDF]

open access: yesLogical Methods in Computer Science, 2021
We examine some combinatorial properties of parallel cut elimination in multiplicative linear logic (MLL) proof nets. We show that, provided we impose a constraint on some paths, we can bound the size of all the nets satisfying this constraint and ...
Jules Chouquet, Lionel Vaux Auclair
doaj   +1 more source

Subjective optimality in finite sequential decision-making [PDF]

open access: yesPLOS Computational Biology, 2020
AbstractMany decisions in life are sequential and constrained by a time window. Although mathematically derived optimal solutions exist, it has been reported that humans often deviate from making optimal choices. Here, we used a secretary problem, a classic example of finite sequential decision-making, and investigated the mechanisms underlying ...
Yeonju Sin   +4 more
openaire   +5 more sources

Sequential Finite Element Model of Tissue Electropermeabilisation [PDF]

open access: yesThe 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2005
Permeabilization, when observed on a tissue level, is a dynamic process resulting from changes in membrane permeability when exposing biological cells to external electric field (E). In this paper we present a sequential finite element model of E distribution in tissue which considers local changes in tissue conductivity due to permeabilization.
Sel, Davorka   +5 more
openaire   +4 more sources

Solving Sequential Conditions by Finite-State Strategies [PDF]

open access: yesTransactions of the American Mathematical Society, 1969
Our main purpose is to present an algorithm which decides whether or not a condition 𝕮(X, Y) stated in sequential calculus admits a finite automata solution, and produces one if it exists. This solves a problem stated in [4] and contains, as a very special case, the answer to Case 4 left open in [6].
Buchi, J. Richard   +1 more
openaire   +3 more sources

Efficient controls for finitely convergent sequential algorithms [PDF]

open access: yesACM Transactions on Mathematical Software, 2010
Finding a feasible point that satisfies a set of constraints is a common task in scientific computing; examples are the linear feasibility problem and the convex feasibility problem. Finitely convergent sequential algorithms can be used for solving such problems; an example of such an algorithm is ART3, which is defined in such a way that its control ...
Wei, Chen, Gabor T, Herman
openaire   +2 more sources

Intensional and Extensional Semantics of Bounded and Unbounded Nondeterminism [PDF]

open access: yes, 2019
We give extensional and intensional characterizations of nondeterministic functional programs: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them.
Laird, James
core   +2 more sources

On Global Types and Multi-Party Session [PDF]

open access: yes, 2011
Global types are formal specifications that describe communication protocols in terms of their global interactions. We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are ...
B. Genest   +17 more
core   +10 more sources

Estimation of finite sequential games [PDF]

open access: yesJournal of Econometrics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Home - About - Disclaimer - Privacy