Results 61 to 70 of about 8,270 (198)
Minsky machines and algorithmic problems
, 2015 This is a survey of using Minsky machines to study algorithmic problems in semigroups, groups and other algebraic systems.Comment: 19 ...
A Karrass +25 more
core +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Large language models (LLMs) have made remarkable advances in natural language processing, demonstrating great potential in modelling structured sequences. However, adapting these capabilities to machine gaming tasks such as Go remains challenging due to limitations in strategy generalisation and optimisation efficiency.
Xiali Li +5 more
wiley +1 more source
Avoiding Abelian powers in binary words with bounded Abelian complexity
, 2010 The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden's theorem, they proved that if a word avoids Abelian $k$-powers for ...
Cassaigne, Julien +3 more
core +2 more sources
Subword Complexes and Nil-Hecke Moves
Modeling and Analysis of Information Systems, 2015 6 pages. Comments welcome! arXiv admin note: substantial text overlap with arXiv:1305.5499; and text overlap with arXiv:1111.3349 by other ...
openaire +5 more sources
Journal of Forensic Sciences, EarlyView.Abstract The rising rate of drug‐related deaths in the United States, largely driven by fentanyl, requires timely and accurate surveillance. However, critical overdose data are often buried in free‐text coroner reports, leading to delays and information loss when coded into ICD (International Classification of Disease)‐10 classifications.
Arthur J. Funnell +8 more
wiley +1 more source
BMC Bioinformatics, 2010 Background While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives when multiple alignments fail.
Grasseau Gilles +5 more
doaj +1 more source
On shuffle products, acyclic automata and piecewise-testable languages
, 2019 We show that the shuffle $L \unicode{x29E2} F$ of a piecewise-testable language $L$ and a finite language $F$ is piecewise-testable. The proof relies on a classic but little-used automata-theoretic characterization of piecewise-testable languages.
Halfon, Simon, Schnoebelen, Philippe
core +3 more sources
LLM‐based prior elicitation for Bayesian graphical modeling
British Journal of Mathematical and Statistical Psychology, EarlyView.ABSTRACT In the Bayesian graphical modeling framework, priors on network structure encode theoretical assumptions and uncertainty about the topology of psychological constructs under study. For instance, the Bernoulli prior specifies the probability of each pairwise interaction, the Beta–Bernoulli prior governs expected network density, and the ...
Nikola Sekulovski +2 more
wiley +1 more source
Properties of the complexity function for finite words
Journal of Numerical Analysis and Approximation Theory, 2004 The subword complexity function \(p_{w}\) of a finite word \(w\) over a finite alphabet \(A\) with \(\operatorname*{card}A=q\geq1\) is defined by \(p_{w}(n)=\operatorname*{card}(F(w)\cap A^{n})\) for \(n\in\mathbb{N},\) where \(F(w)\) represents the set ...
Mira-Cristiana Anisiu, Julien Cassaigne
doaj +2 more sources
Finitely Generated Groups Are Universal
, 2016 Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same computability-theoretic ...
Johnathan E. Ormond-Prout (2131201) +2 more
core +3 more sources