Results 61 to 70 of about 4,711,783 (279)

Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages [PDF]

, 2008
The spider diagram logic forms a fragment of the constraint diagram logic and was designed to be primarily used as a diagrammatic software specification tool.
Simon Thompson, John Taylor, Taylor, John, Delaney, Aidan, Thompson, Simon, Aidan Delaney   +5 more
core   +1 more source

Commutative Languages and their Composition by Consensual Methods [PDF]

Electronic Proceedings in Theoretical Computer Science, 2014
Commutative languages with the semilinear property (SLIP) can be naturally recognized by real-time NLOG-SPACE multi-counter machines. We show that unions and concatenations of such languages can be similarly recognized, relying on – and further ...
Stefano Crespi Reghizzi, Pierluigi San Pietro   +1 more
doaj   +1 more source

The limited regular languages

Theoretical Computer Science, 1988
AbstractThis paper is a continuation of [3]. It gives some further properties of limited regular languages and partial solutions to two of S. Eilenberg's open problems [2, p. 158].
Chang-jie Tang, Yili Zhang
openaire   +2 more sources

Polarization‐resolved femtosecond Vis/IR spectroscopy tailored for resolving weak signals in biological samples using minimal sample volume

FEBS Open Bio, EarlyView.
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley   +1 more source

Effect of nitrogen over corn-grass association in the renovation of pastures at piedmont of the Llanos Orientales of Colombia

Agronomía Colombiana, 2011
<p class="MsoNormal" style="text-align: justify; line-height: normal; margin: 0cm 0cm 0pt; mso-layout-grid-align: none;"><span style="font-family: ";MinionPro-Regular";,";serif";; font-size: 9.5pt; mso-bidi-font-family: MinionPro-Regular; mso ...
Ligarreto Moreno Gustavo Adolfo, Rincón C. Álvaro   +1 more
doaj  

Regular Languages in the Sliding Window Model [PDF]

TheoretiCS
We study the space complexity of the following problem: For a fixed regular language $L$, we receive a stream of symbols and want to test membership of a sliding window of size $n$ in $L$.
Moses Ganardi, Danny Hucke, Markus Lohrey, Konstantinos Mamouras, Tatiana Starikovskaya   +4 more
doaj   +1 more source

Sudden anaerobization in Amphibacillus xylanus increases intracellular labile ferrous iron and inhibits cell growth

FEBS Open Bio, EarlyView.
Abruptly changing from aerobic to anaerobic conditions (sudden anaerobization) induced growth inhibition and a significant increase in intracellular labile ferrous iron in the aerotolerant anaerobe Amphibacillus xylanus. We found that free flavins mediate efficient electron transfer from NADH to ferric iron under anaerobic conditions, suggesting that ...
Shinya Kimata, Yoichi Sakai, Keisuke Tanaka, Etsuro Yoshimura, Ken Kitano, Morio Ishikawa, Tadahiro Nakamoto, Tsutomu Takayama, Hirofumi Inoue, Kaho Nomura, Tomonori Suzuki, Masataka Uchino, Akira Abe, Youichi Niimura   +13 more
wiley   +1 more source

Evaluation of models for estimating the reference evapotranspiration in Colombian Coffee Zone

Agronomía Colombiana, 2011
<p class="MsoNormal" style="text-align: justify; line-height: normal; margin: 0cm 0cm 0pt; mso-layout-grid-align: none;"><span style="font-family: ";MinionPro-Regular";,";serif";; font-size: 9.5pt; mso-bidi-font-family: MinionPro-Regular; mso ...
Ramírez Víctor Hugo, Mejía Alexandra, Marín Elsa Viviana, Arango Rafael   +3 more
doaj  

Representing Small Ordinals by Finite Automata [PDF]

Electronic Proceedings in Theoretical Computer Science, 2010
It is known that an ordinal is the order type of the lexicographic ordering of a regular language if and only if it is less than omega^omega. We design a polynomial time algorithm that constructs, for each well-ordered regular language L with respect to ...
Zoltan Ésik
doaj   +1 more source

Parameterized regular expressions and their languages

Theoretical Computer Science, 2013
We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if it is denoted by some regular expression obtained by replacing variables with letters; under the certainly ...
Pablo Barceló, Leonid Libkin, Juan L. Reutter   +2 more
openaire   +10 more sources