Results 31 to 40 of about 649 (143)
On subword complexity functions
Discrete Applied Mathematics, 1984 The author finds a polynomial formula for the subword complexity function of a cyclic language. A characterization of context-free languages with exponential subword complexity is derived by appropriately using the pumping lemma.
openaire +2 more sources
The Subword Complexity of a Two-Parameter Family of Sequences [PDF]
The Electronic Journal of Combinatorics, 2001 We determine the subword complexity of the characteristic functions of a two-parameter family $\{A_n\}_{n=1}^\infty$ of infinite sequences which are associated with the winning strategies for a family of 2-player games. A special case of the family has the form $A_n=\lfloor n\alpha\rfloor$ for all $n\in {\bf Z}_{>0}$, where $\alpha$ is a fixed ...
Aviezri S. Fraenkel +2 more
openaire +2 more sources
Advanced Materials, EarlyView.Magnetic tunnel junctions (MTJs) using MgO tunnel barriers face challenges of high resistance‐area product and low tunnel magnetoresistance (TMR). To discover alternative materials, Literature Enhanced Ab initio Discovery (LEAD) is developed. The LEAD‐predicted materials are theoretically evaluated, showing that MTJs with dusting of ScN or TiN on ...
Sabiq Islam +6 more
wiley +1 more source
IEEE AccessSindhi word segmentation is a challenging task due to space omission and insertion issues. The Sindhi language itself adds to this complexity. It’s cursive and consists of characters with inherent joining and non-joining properties, independent of
Wazir Ali +5 more
doaj +1 more source
Sequences With Subword Complexity 2n
Journal of Number Theory, 1994 The complexity of an infinite sequence taking finitely many values is the function \(n \to P(n)\), where \(P(n)\) is the number of blocks of length \(n\) occurring in the sequence (the usual term for ``blocks'' is ``factors'' in the European terminology and ``subwords'' in the American terminology). One can be interested in the asymptotic behaviour of \
openaire +2 more sources
An Autonomous Large Language Model‐Agent Framework for Transparent and Local Time Series Forecasting
Advanced Intelligent Discovery, EarlyView.Architecture of the proposed large language model (LLM)‐based agent framework for autonomous time series forecasting in thermal power generation systems. The framework operates through a vertical pipeline initiated by natural language queries from users, which are processed by the LLM Agent Core powered by Llama.cpp and a ReAct loop with persistent ...
William Gouvêa Buratto +5 more
wiley +1 more source
Schubert Patches Degenerate to Subword Complexes [PDF]
Transformation Groups, 2008 11 ...
openaire +3 more sources
Advanced Intelligent Discovery, EarlyView.An end‐to‐end knowledge discovery framework is established to automate high‐precision property extraction from small, specialized literature corpora. Utilizing a domain‐specific bidirectional encoder representation from a transformer model and data augmentation, the system accurately extracts and structures electrolyte performance data, ultimately ...
Gaheun Shin +4 more
wiley +1 more source
Journal of Synchrotron Radiation, EarlyView.This paper validates the OpenAlex model for real‐time topic classification of synchrotron proposals. The proposed live service architecture incorporates user verification, providing a scalable solution for introducing enhanced topic metadata into scientific workflows without sacrificing precision.Experiment proposals at synchrotron facilities serve as ...
Terence Tan +22 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