Results 91 to 100 of about 1,475,237 (325)
Joint low power state assignment of sequential automata of a net implementing a parallel automaton
Informatika, 2023 Objectives. The problem of low power state assignment of partial states of a parallel automaton is considered. The objective of the paper is to investigate the possibilities of using the decomposition in state assignment of partial states in order to ...
Yu. V. Pottosin
doaj +1 more source
Weighted tree-walking automata [PDF]
, 2009 We define weighted tree-walking automata. We show that the class of tree series recognizable by weighted tree-walking automata over a commutative semiring K is a subclass of the class of regular tree series over K.
Muzamel Loránd, Fülöp Zoltán
core
FEBS Open Bio, EarlyView.The PAM pathway and its impact on cellular metabolism. Color‐coded key symbols represent Rapamycin (R, orange, targeting mTOR) and Dactolisib (D, green, targeting PI3K/mTOR), indicating their sites of action. Created with BioRenders.com. Glioblastoma resists therapy through interconnected survival programs.
Kai Zhao +23 more
wiley +1 more source
Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 This paper studies the problem of computing Nash equilibrium in wireless networks modeled by Weighted Timed Automata. Such formalism comes together with a logic that can be used to describe complex features such as timed energy constraints.
Peter Bulychev +4 more
doaj +1 more source
Weighted finite automata with output [PDF]
Soft Computing, 2017 In this paper we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here.
Jelena Ignjatovic +2 more
openaire +3 more sources
Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata [PDF]
, 2021 We address the approximate minimization problem for weighted finite automata (WFAs) with weights in ℝ, over a one-letter alphabet: to compute the best possible approximation of a WFA given a bound on the number of states. This work is grounded in Adamyan-
Rabusseau, Guillaume +4 more
core +1 more source
Memory and Resting‐State Connectivity in Acute Transient Global Amnesia: A Case–Control fMRI Study
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Transient global amnesia (TGA) is a striking model of isolated amnesia. While hippocampal lesions are well described, the network‐level mechanisms and the precise neuropsychological profile remain debated. Our objective was thus to characterize functional and neuropsychological correlates of acute TGA and their ...
Elias El Otmani +10 more
wiley +1 more source
Two-Way Representations and Weighted Automata [PDF]
, 2015 We study the series realized by weighted two-way automata, that are strictly more powerful than weighted one-way automata. To this end, we consider the Hadamard product and the Hadamard iteration of formal power series. We introduce the representation of
Lombardy, Sylvain
core +2 more sources
Coalgebraic trace semantics via forgetful logics [PDF]
Logical Methods in Computer Science, 2017 We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of generative ...
Bartek Klin, Jurriaan Rot
doaj +1 more source
Coalgebraic semantics of heavy-weighted automata [PDF]
, 2014 We study heavy-weighted automata, a generalization of weighted automata in which the weights of the transitions can be any formal power series. We define their semantics in three equivalent ways, and give some examples of how they can provide a more ...
Bonsangue, M.M. (Marcello) +2 more
core