Results 1 to 10 of about 15,965 (213)
Transition Complexity of Incomplete DFAs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 In this paper, we consider the transition complexity of regular languages based on the incomplete deterministic finite automata. A number of results on Boolean operations have been obtained.
Yuan Gao, Kai Salomaa, Sheng Yu
doaj +7 more sources
Boolean Circuit Complexity of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity.
Maris Valdats
doaj +6 more sources
Real-space machine learning of correlation density functionals [PDF]
Nature CommunicationsMachine learning (ML) plays a pivotal role in extending the reach of quantum chemistry methods for simulating both molecules and materials. However, leveraging ML to overcome the limitations of human-designed density functional approximations (DFAs), the
Elias Polak, Heng Zhao, Stefan Vuckovic
doaj +2 more sources
DFAs and PFAs with Long Shortest Synchronizing Word Length [PDF]
, 2017 It was conjectured by \v{C}ern\'y in 1964, that a synchronizing DFA on $n$ states always has a shortest synchronizing word of length at most $(n-1)^2$, and he gave a sequence of DFAs for which this bound is reached.
A Roman +10 more
core +4 more sources
Acta PsychologicaObjectives: Individuals vary in their levels of Desire for Aesthetics, ranging from superficial interest to profound immersion. However, there is currently a lack of measurement tools available to assess Desire for Aesthetics across various domains ...
Bjarn-Ove Tetzlaff +3 more
doaj +2 more sources
Effect of Fatty Acids on Backfat Quality in Beijing Black Pigs [PDF]
FoodsThe quality of pig backfat affects both pork quality and consumer preferences. Fatty acids (FAs) are crucial in determining the backfat quality. This study assessed the effect of FAs on the backfat quality and identified candidate genes associated with ...
Xueli Zhu +9 more
doaj +2 more sources
Learning Residual Finite-State Automata Using Observation Tables [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We define a two-step learner for RFSAs based on an observation table by using an algorithm for minimal DFAs to build a table for the reversal of the language in question and showing that we can derive the minimal RFSA from it after some simple ...
Anna Kasprzik
doaj +4 more sources
Quantum circuits from non-unitary sparse binary matrices [PDF]
Scientific ReportsQuantum computing leverages unitary matrices to perform reversible computations while preserving probability norms. However, many real-world applications involve non-unitary sparse matrices, posing a challenge for quantum implementation.
Krishnageetha Karuppasamy +3 more
doaj +2 more sources
Evaluating ocular torsion following inferior oblique weakening in superior oblique palsy: a pilot study using color fundus photography and spectral domain optical coherence tomography [PDF]
BMC OphthalmologyPurpose To compare spectral domain optical coherence tomography (OCT) and color fundus photography (CFP) for assessing ocular cyclotorsion in unilateral congenital superior oblique palsy (SOP) before and after inferior oblique disinsertion.
Kaveh Abri Aghdam +8 more
doaj +2 more sources
Incremental DFA minimisation [PDF]
RAIRO - Theoretical Informatics and Applications, 2011 We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied to a given automaton at the same time as it is processing a string for acceptance.
Marco Almeida +2 more
openaire +1 more source