Search results for "informatica"
showing 10 items of 1003 documents
Nondeterministic Moore automata and Brzozowski's minimization algorithm
2012
AbstractMoore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to a given NMA. We propose an algorithm that is a variant of Brzozowski’s minimization algorithm in the sense that it is essentially structured as reverse operation and subset construction performed twice. Moreover, we explore more general classes of NMA and analyze the applicability of the algorithm. For some of such classes the algorith…
Extremal minimality conditions on automata
2012
AbstractIn this paper we investigate the minimality problem of DFAs by varying the set of final states. In other words, we are interested on how the choice of the final states can affect the minimality of the automata. The state-pair graph is a useful tool to investigate such a problem. The choice of a set of final states for the automaton A defines a coloring of the closed components of the state-pair graph and the minimality of A corresponds to a property of these colored components. A particular attention is devoted to the analysis of some extremal cases such as, for example, the automata that are minimal for any choice of the subset of final states F from the state set Q of the automato…
A graph theoretic approach to automata minimality
2012
AbstractThe paper presents a graph-theoretic approach to test the minimality of a deterministic automaton. In particular, we focus on problems concerning the dependence of the minimality of an automaton on the choice of the set F of final states or on the cardinality of the set F. We introduce different minimality conditions of an automaton and show that such conditions can be characterized in graph-theoretic terms.
Nondeterministic Moore Automata and Brzozowski’s Algorithm
2011
Moore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to a given NMA. In this paper we propose an algorithm that is a variant of Brzozowski's algorithm in the sense that it is essentially structured as reverse operation and subset construction performed twice.
On Extremal Cases of Hopcroft’s Algorithm
2009
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees of freedom, so there can exist different sequences of refinements of the set of the states that lead to the final partition. We find an infinite family of binary automata for which such a process is unique. Some recent papers (cf. [3,7,1]) have been devoted to find families of automata for which Hopcroft’s algorithm has its worst execution time. They are unary automata associated to circular words. However, automata minimization can be achieved also in linear time when the alphabet has only one letter (cf. [14]), so in …
Transitive Reasoning with Imprecise Probabilities
2015
We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent \(\text{ p-consistent }\) sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Finally, we present the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases.
Feasibility of Linear Parametric Estimation of Dynamic Information Measures to assess Physiological Stress from Short-Term Cardiovascular Variability
2021
Extensive efforts have been recently devoted to implement fast and reliable algorithms capable of assessing the physiological response of the organism to physiological stress. In this study, we propose the comparison between model-free and linear parametric methods as regards their ability to detect alterations in the dynamics and in the complexity of cardiovascular and respiratory variability evoked by postural and mental stress. Dynamic entropy (DE) and information storage (IS) measures were calculated on three physiological time-series, i.e. heart period, respiratory volume and systolic arterial pressure, on 61 healthy subjects monitored in resting conditions as well as during head-up ti…
Information Decomposition: A Tool to Dissect Cardiovascular and Cardiorespiratory Complexity
2017
This chapter reports some recent developments of information-theoretic concepts applied to the description of coupled dynamical systems, which allow to decompose the entropy of an assigned target system into components reflecting the information stored in the system and the information transferred to it from the other systems, as well as the nature (synergistic or redundant) of the information transferred to the target. The decomposition leads to well-defined measures of information dynamics which in the chapter will be defined theoretically, computed in simulations of linear Gaussian systems and implemented in practice through the application to heart period, arterial pressure and respirat…
Post-fire practices benefits on vegetation recovery and soil conservation in a Mediterranean area
2021
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG. [Abstract] Post-fire practices (PFP) aim to reduce soil erosion and favour vegetation recovery, but their effectiveness is spatially heterogeneous and under debate because of the economic and environmental costs. This study evaluates the different changes (Δ) of canopy cover (CC), sediment connectivity (SC) and local topography in four areas affected by the Pinet fire in eastern Spain (August 8th, 2018) and managed with: totally burnt with tree removal and long log erosion barriers (LEBs) (Pinet-1), partially burnt without PFP (Pinet-2), totally burnt with tree removal and short LEBs (Pinet-3), and totally burnt wit…
A portable electronic system for non-invasive real-time acquisition of multiple physiological signals
2019
In this work, we have designed and realised a portable and compact electronic system for the synchronous acquisition of multiple physiological signals. The system employs a Texas Instruments ADS1298 front-end with 24-bit resolution for data acquisition and supports up to 8 channels and 4 kHz sampling rate. The front-end communicates via SPI with a STM32 microcontroller which pre-processes the data and sends them through USB or Bluetooth to a suitable PC application. The system has been realized for the simultaneous acquisition of electrocardiographic (ECG) and photoplethysmographic (PPG) signals, but it can also be employed for acquiring other typologies of signals, e.g. breathing or electr…