Results 21 to 30 of about 6,380 (117)
Bisimilarity is not Borel [PDF]
We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it.
Terraf, Pedro Sánchez
core +1 more source
Can Nondeterminism Help Complementation?
Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature.
Aniello Murano +26 more
core +2 more sources
Narrating Entanglement Without Dehumanisation in Contemporary Eco‐Fiction
ABSTRACT This essay presents a comparative analysis of two contemporary works of eco‐fiction, Richard Powers's The Overstory (2018) and Eleanor Catton's Birnam Wood (2023). Both novels use multiperspective narration in the service of entanglement narratives, forms of storytelling that emphasise the interconnection of human and nonhuman life.
Diana Rose Newby
wiley +1 more source
Copulas for Covariate Simulation in Pharmacometrics
ABSTRACT Patient‐specific covariates are commonly incorporated in pharmacometric and quantitative system pharmacology models to predict differences in pharmacokinetic or pharmacodynamic profiles between patients. When simulating new virtual populations of patients, generating realistic covariate sets that accurately reflect the correlation structures ...
Yuchen Guo +3 more
wiley +1 more source
Uncertainty‐Aware Machine Learning Models for Flash Flood Prediction
ABSTRACT Flash floods have intensified in recent years, and machine learning (ML) models are increasingly used for real‐time prediction. However, most ML‐based flood‐forecasting studies remain largely deterministic and provide limited evidence on how input uncertainty propagates to forecasts, compromising reliability for operational early‐warning ...
Jaqueline A. J. P. Soares +5 more
wiley +1 more source
Efficient Monitoring of ??-languages [PDF]
We present a technique for generating efficient monitors for Omega-regular-languages. We show how Buchi automata can be reduced in size and transformed into special, statistically optimal nondeterministic finite state machines, called binary transition ...
d'Amorim, Marcelo, Rosu, Grigore
core
A Hybrid Machine Learning Framework to Improve Morphological Trait Recovery in Avian Datasets
Our hybrid models integrating local pattern recognition, nonlinear mapping, and adaptive optimization are anticipated to elevate the accuracy of the imputation while preserving the distinctiveness of biological datasets, thus providing a more reliable foundation for ecological and evolutionary research.
Yu Bai +9 more
wiley +1 more source
Minimizing finite automata is computationally hard [PDF]
It is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e., a DFA M can be converted to an equivalent DFA M' which has a minimal number of states. The minimization can be done efficiently [6].
Malcher, Andreas
core
Processing Succinct Matrices and Vectors
We study the complexity of algorithmic problems for matrices that are represented by multi-terminal decision diagrams (MTDD). These are a variant of ordered decision diagrams, where the terminal nodes are labeled with arbitrary elements of a semiring ...
A. Bertoni +21 more
core +1 more source
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique
ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh +2 more
wiley +1 more source

