Amore: A system for computing automata, MOnoids, and regular expressions

2005 ◽  
pp. 537-538 ◽  
Author(s):  
V. Kell ◽  
A. Maier ◽  
A. Potthoff ◽  
W. Thomas ◽  
U. Wermuth
Keyword(s):  
Regular Expressions

ESP corpus design: compilation of the Veterinary Nursing Medical Chart Corpus and the Veterinary Nursing Wordlist

Corpora ◽  
2020 ◽  
Vol 15 (2) ◽  
pp. 125-140
Author(s):  
Yukiko Ohashi ◽  
Noriaki Katagiri ◽  
Katsutoshi Oka ◽  
Michiko Hanada
Keyword(s):  
Word List ◽  
English For Specific Purposes ◽  
Regular Expressions ◽  
Annotation Scheme ◽  
Corpus Design ◽  
As Species ◽  
Lexical Items ◽  
Access To Data ◽  
General Service

This paper reports on two research results: ( 1) designing an English for Specific Purposes (esp) corpus architecture complete with annotations structured by regular expressions; and ( 2) a case study to test the design to cater for creating a specific vocabulary list using the compiled corpus. The first half of this study involved designing a precisely structured esp corpus from 190 veterinary medical charts with a hierarchy of the data. The data hierarchy in the corpus consists of document types, outline elements and inline elements, such as species and breed. Perl scripts extracted the data attached to veterinary-specific categories, and the extraction led to creating wordlists. The second part of the research tested the corpus mode, creating a list of commonly observed lexical items in veterinary medicine. The coverage rate of the wordlists by General Service List (gsl) and Academic Word List (awl) was tested, with the result that 66.4 percent of all lexical items appeared in gsl and awl, whereas 33.7 percent appeared in none of those lists. The corpus compilation procedures as well as the annotation scheme introduced in this study enable the compilation of specific corpora with explicit annotations, allowing teachers to have access to data required for creating esp classroom materials.

SSMBS: a web server to locate sequentially separated motifs in biological sequences

2009 ◽  
Vol 43 (1) ◽  
pp. 203-205 ◽  
Author(s):  
Chetan Kumar ◽  
K. Sekar
Keyword(s):  
Amino Acids ◽  
Web Server ◽  
Nucleotide Sequences ◽  
Regular Expressions ◽  
Biological Sequences ◽  
Sequence Motifs ◽  
Specific Order ◽  
The Web

The identification of sequence (amino acids or nucleotides) motifs in a particular order in biological sequences has proved to be of interest. This paper describes a computing server,SSMBS, which can locate and display the occurrences of user-defined biologically important sequence motifs (a maximum of five) present in a specific order in protein and nucleotide sequences. While the server can efficiently locate motifs specified using regular expressions, it can also find occurrences of long and complex motifs. The computation is carried out by an algorithm developed using the concepts of quantifiers in regular expressions. The web server is available to users around the clock at http://dicsoft1.physics.iisc.ernet.in/ssmbs/.

scholarly journals Quantitative Verification of Stochastic Regular Expressions

2021 ◽  
Vol 179 (2) ◽  
pp. 135-163
Author(s):  
Sinem Getir Yaman ◽  
Esteban Pavese ◽  
Lars Grunske
Keyword(s):  
Performance Evaluation ◽  
Model Checking ◽  
Regular Expressions ◽  
Verification Algorithm ◽  
Computation Tree ◽  
Quantitative Verification ◽  
Probabilistic Action ◽  
Local Results ◽  
Novel Model ◽  
Stochastic Regular Expressions

In this article, we introduce a probabilistic verification algorithm for stochastic regular expressions over a probabilistic extension of the Action based Computation Tree Logic (ACTL*). The main results include a novel model checking algorithm and a semantics on the probabilistic action logic for stochastic regular expressions (SREs). Specific to our model checking algorithm is that SREs are defined via local probabilistic functions. Such functions are beneficial since they enable to verify properties locally for sub-components. This ability provides a flexibility to reuse the local results for the global verification of the system; hence, the framework can be used for iterative verification. We demonstrate how to model a system with an SRE and how to verify it with the probabilistic action based logic and present a preliminary performance evaluation with respect to the execution time of the reachability algorithm.

Sign in / Sign up

Export Citation Format

Share Document