Results 31 to 40 of about 29,290 (288)
Minimal and hyper-minimal biautomata [PDF]
, 2014 We compare deterministic finite automata (DFAs) and biautomata under the following two aspects: structural similarities between minimal and hyper-minimal automata, and computational complexity of the minimization and hyper-minimization problem ...
Holzer, Markus, Jakobi, Sebastian
core +1 more source
Synchronizing non-deterministic finite automata [PDF]
, 2017 In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same synchronizing word length. This implies that \v{C}ern\'y's conjecture generalizes to CNFAs and that the general upper bound for the length of a shortest D3 ...
Don, Henk, Zantema, Hans
core +2 more sources
The Predictive Power of Exact Constraints and Appropriate Norms in Density Functional Theory. [PDF]
Annual review of physical chemistry (Print), 2022 Ground-state Kohn-Sham density functional theory provides, in principle, the exact ground-state energy and electronic spin densities of real interacting electrons in a static external potential.
Aaron D. Kaplan, M. Levy, J. Perdew
semanticscholar +1 more source
On the Shuffle Automaton Size for Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 We investigate the state size of DFAs accepting the shuffle of two words. We provide words u and v, such that the minimal DFA for u shuffled with v requires an exponential number of states.
Franziska Biegler +2 more
doaj +1 more source
State Complexity of Catenation Combined with Star and Reversal [PDF]
, 2010 This paper is a continuation of our research work on state complexity of combined operations. Motivated by applications, we study the state complexities of two particular combined operations: catenation combined with star and catenation combined with ...
Bo Cui +5 more
core +3 more sources
Piecewise Testable Languages and Nondeterministic Automata [PDF]
, 2016 A regular language is $k$-piecewise testable if it is a finite boolean combination of languages of the form $\Sigma^* a_1 \Sigma^* \cdots \Sigma^* a_n \Sigma^*$, where $a_i\in\Sigma$ and $0\le n \le k$.
Masopust, Tomáš
core +2 more sources
Diabetes, Metabolic Syndrome and Obesity, 2022 Teng Zhang,1,2,* Juan Huang,1,3,* Yanru Li,1,* Dubo Zhong,4 Songmei Wang,1 Fang Xu,1 Xuehui Zhang,1 Yuemei Feng,1 Jianzhong Yin1,2 1School of Public Health, Kunming Medical University, Kunming, People’s Republic of China; 2Baoshan College of ...
Zhang T +8 more
doaj
Large Aperiodic Semigroups [PDF]
, 2014 The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup generated by ...
A. Kisielewicz +11 more
core +3 more sources
Frontiers in Human Neuroscience, 2016 Foreign accent syndrome (FAS) is a speech disorder that is defined by the emergence of a peculiar manner of articulation and intonation which is perceived as foreign. In most cases of acquired FAS (AFAS) the new accent is secondary to small focal lesions
Marcelo L Berthier +17 more
doaj +1 more source
Topics in Cognitive Science, EarlyView., 2023 Abstract Fractal fluctuations are a core concept for inquiries into human behavior and cognition from a dynamic systems perspective. Here, we present a generalized variance method for multivariate detrended fluctuation analysis (mvDFA). The advantage of this extension is that it can be applied to multivariate time series and considers intercorrelation ...
Sebastian Wallot +5 more
wiley +1 more source