Results 61 to 70 of about 7,287,958 (273)
Spectral properties of singular Sturm-Liouville operators with indefinite weight sgn x [PDF]
, 2007 We consider a singular Sturm-Liouville expression with the indefinite weight sgn x. To this expression there is naturally a self-adjoint operator in some Krein space associated.
Karabash, I., Trunk, C.
core +2 more sources
Helping tools for the regular expression author for test questions in LMS Moodle
Открытое образование (Москва), 2016 Composing regular expressions for test questions is often a difficult thing for the teachers; so many teachers avoid using regular expression questions. Similar problems hinder students learning regular expressions as a part of computer science.
O. A. Sychev, G. V. Terehov
doaj +1 more source
Regular Expression Search on Compressed Text
, 2019 We present an algorithm for searching regular expression matches in compressed text. The algorithm reports the number of matching lines in the uncompressed text in time linear in the size of its compressed version.
Ganty, Pierre, Valero, Pedro
core +1 more source
Spatial Spectrum Analysis of Wave-Front Correction with a Segmented Mirror [PDF]
, 2003 An expression is derived for the spatial power spectrum of wave-front errors after correction with a segmented mirror. This includes estimates of the spectral contributions of segment piston and tilt corrections and spatial aliasing by a regular array of
Padin, Stephen
core +1 more source
Regular Expressions in Process Algebra [PDF]
20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2006 We tackle an open question of Milner (1984). We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions.
CORRADINI, Flavio, BAETEN J.
openaire +4 more sources
Games for Succinctness of Regular Expressions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2021 We present a version of so called formula size games for regular expressions. These games characterize the equivalence of languages up to expressions of a given size. We use the regular expression size game to give a simple proof of a known non-elementary succinctness gap between first-order logic and regular expressions.
openaire +5 more sources
Regular expression constrained sequence alignment revisited [PDF]
, 2011 International audienceImposing constraints in the form of a finite automaton or a regular expression is an effective way to incorporate additional a priori knowledge into sequence alignment procedures.
Kucherov, Gregory +2 more
core +4 more sources
Efficient i-DFA construction algorithm based on state grouping
Tongxin xuebao, 2013 Regular expression matching plays an important role in many network and security applications.DFA is the preferred representation to perform regular expression matching in high-speed network,because of its high and stable matching efficiency.However,DFA ...
Deng-ke QIAO +4 more
doaj +2 more sources
Statistical mechanics of Floquet systems with regular and chaotic states
, 2010 We investigate the asymptotic state of time-periodic quantum systems with regular and chaotic Floquet states weakly coupled to a heat bath. The asymptotic occupation probabilities of these two types of states follow fundamentally different distributions.
A. Voros +5 more
core +1 more source
State Elimination Ordering Strategies: Some Experimental Results
, 2010 Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case.
Davide Nabais +4 more
core +2 more sources