Results 71 to 80 of about 5,692,247 (342)

Games for Succinctness of Regular Expressions [PDF]

open access: yesElectronic 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

Metoda wyodrębniania odtwarzalnych konstrukcji werbo-nominalnych języka rosyjskiego z korpusów tekstowych

open access: yesStudia Rossica Posnaniensia, 2019
The article describes an extraction method of Russian verbal-nominative structures from electronic texts with the use of grammatical annotation and regular expressions syntax. The stages of the retrieval process are outlined.
Yury Fedorushkov, Daniel Dzienisiewicz
doaj   +1 more source

Models of Nondeterministic Regular Expressions

open access: yesJournal of Computer and System Sciences, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CORRADINI, Flavio   +2 more
openaire   +5 more sources

How well are regular expressions tested in the wild?

open access: yesESEC/SIGSOFT FSE, 2018
Developers report testing their regular expressions less than the rest of their code. In this work, we explore how thoroughly tested regular expressions are by examining open source projects.
Peipei Wang, Kathryn T. Stolee
semanticscholar   +1 more source

The unpredictably eruptive dynamics of spruce budworm populations in eastern Canada

open access: yesPopulation Ecology, EarlyView.
We examine historical population data for spruce budworm from several locations through the period 1930–1997, and use density‐dependent recruitment curves to test whether the pattern of population growth over time is more consistent with Royama's (1984; Ecological Monographs 54:429–462) linear R(t) model of harmonic oscillation at Green River New ...
Barry J. Cooke, Jacques Régnière
wiley   +1 more source

Network topology drives population temporal variability in experimental habitat networks

open access: yesPopulation Ecology, EarlyView.
Habitat patches connected by dispersal pathways form habitat networks. We explored how network topology affects population outcomes in laboratory experiments using a model species (Daphnia carinata). Central habitat nodes in complex lattice networks exhibited lower temporal variability in population sizes, suggesting they support more stable ...
Yiwen Xu   +3 more
wiley   +1 more source

EXPRESSÃO REGULAR NUMÉRICA

open access: yesColloquium Exactarum, 2014
This article defines the formal definition of the computer program language Numeric Regular Expression. A language concept inspired by Regular Expression syntax, applying your power and flexibility to numeric chains are describe.
Bruno Vier Hoffmeister, Marta Bez
doaj   +1 more source

Rewriting extended regular expressions

open access: yesTheoretical Computer Science, 1993
We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn equational axiomatization of the algebra and develop some term-rewriting ...
Peter D. Mosses, Valentin M. Antimirov
openaire   +3 more sources

occumb: An R package for site occupancy modeling of eDNA metabarcoding data

open access: yesPopulation Ecology, EarlyView.
This study introduces a new R package, occumb, for the convenient application of site occupancy modeling using environmental DNA (eDNA) metabarcoding data. We outline a data analysis workflow, including data setup, model fitting, model assessment, and comparison of potential study settings based on model predictions, all of which can be performed using
Keiichi Fukaya, Yuta Hasebe
wiley   +1 more source

Flowchart Programs, Regular Expressions, and Decidability of Polynomial Growth-Rate [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2016
We present a new method for inferring complexity properties for a class of programs in the form of flowcharts annotated with loop information. Specifically, our method can (soundly and completely) decide if computed values are polynomially bounded as a ...
Amir M. Ben-Amram, Aviad Pineles
doaj   +1 more source

Home - About - Disclaimer - Privacy